<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Function_approximation</id>
	<title>Function approximation - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.sarg.dev/index.php?action=history&amp;feed=atom&amp;title=Function_approximation"/>
	<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Function_approximation&amp;action=history"/>
	<updated>2026-04-14T01:31:16Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://wiki.sarg.dev/index.php?title=Function_approximation&amp;diff=215317&amp;oldid=prev</id>
		<title>93.99.190.128 at 12:49, 30 October 2025</title>
		<link rel="alternate" type="text/html" href="https://wiki.sarg.dev/index.php?title=Function_approximation&amp;diff=215317&amp;oldid=prev"/>
		<updated>2025-10-30T12:49:11Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{Short description|Approximating an arbitrary function with a well-behaved one}}&lt;br /&gt;
{{distinguish|Curve fitting}}&lt;br /&gt;
[[File:Step function approximation.png|alt=Several approximations of a step function|thumb|Several progressively more accurate approximations of the [[step function]]]]&lt;br /&gt;
[[File:Regression pic gaussien dissymetrique bruite.svg|alt=An asymmetrical Gaussian function fit to a noisy curve using regression.|thumb|An asymmetrical [[Gaussian function]] fit to a noisy curve using regression]]&lt;br /&gt;
In general, a &amp;#039;&amp;#039;&amp;#039;function approximation&amp;#039;&amp;#039;&amp;#039; problem asks us to select a [[function (mathematics)|function]] that closely matches (&amp;quot;approximates&amp;quot;) a function in a task-specific way.&amp;lt;ref&amp;gt;{{Cite book|last1=Lakemeyer|first1=Gerhard|url=https://books.google.com/books?id=PW1qCQAAQBAJ&amp;amp;dq=%22function+approximation+is%22&amp;amp;pg=PA49|title=RoboCup 2006: Robot Soccer World Cup X|last2=Sklar|first2=Elizabeth|last3=Sorrenti|first3=Domenico G.|last4=Takahashi|first4=Tomoichi|date=2007-09-04|publisher=Springer|isbn=978-3-540-74024-7|language=en}}&amp;lt;/ref&amp;gt;{{Better source needed|reason=Find a source that actually explicitly makes this kind of definition; this one doesn&amp;#039;t quite do so|date=January 2022}} The need for function approximations arises, for example, predicting the growth of microbes in [[microbiology]].&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{Cite journal|last1=Basheer|first1=I.A.|last2=Hajmeer|first2=M.|date=2000|title=Artificial neural networks: fundamentals, computing, design, and application|url=https://web.archive.org/web/20230627001502/ethologie.unige.ch/etho5.10/pdf/basheer.hajmeer.2000.fundamentals.design.and.application.of.neural.networks.review.pdf|journal=Journal of Microbiological Methods|volume=43|issue=1|pages=3–31|doi=10.1016/S0167-7012(00)00201-3|pmid=11084225|s2cid=18267806 }}&amp;lt;/ref&amp;gt; Function approximations are used where theoretical models are unavailable or hard to compute.&amp;lt;ref name=&amp;quot;:0&amp;quot;&amp;gt;{{Cite journal|last1=Basheer|first1=I.A.|last2=Hajmeer|first2=M.|date=2000|title=Artificial neural networks: fundamentals, computing, design, and application|url=http://ethologie.unige.ch/etho5.10/pdf/basheer.hajmeer.2000.fundamentals.design.and.application.of.neural.networks.review.pdf|journal=Journal of Microbiological Methods|volume=43|issue=1|pages=3–31|doi=10.1016/S0167-7012(00)00201-3|pmid=11084225|s2cid=18267806 }}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
First, for known target functions [[approximation theory]] is the branch of [[numerical analysis]] that investigates how certain known functions (for example, [[special function]]s) can be approximated by a specific class of functions (for example, [[polynomial]]s or [[rational function]]s) that often have desirable properties (inexpensive computation, continuity, integral and limit values, etc.).&amp;lt;ref&amp;gt;{{Cite book|last1=Mhaskar|first1=Hrushikesh Narhar|url=https://books.google.com/books?id=643OA9qwXLgC&amp;amp;dq=%22approximation+theory%22&amp;amp;pg=PA1|title=Fundamentals of Approximation Theory|last2=Pai|first2=Devidas V.|date=2000|publisher=CRC Press|isbn=978-0-8493-0939-7|language=en}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Secondly, for example, if &amp;#039;&amp;#039;g&amp;#039;&amp;#039; is an operation on the [[real number]]s, techniques of [[interpolation]], [[extrapolation]], [[regression analysis]], and [[curve fitting]] can be used. If the [[codomain]] (range or target set) of &amp;#039;&amp;#039;g&amp;#039;&amp;#039; is a finite set, one is dealing with a [[statistical classification|classification]] problem instead.&amp;lt;ref&amp;gt;{{Cite journal|last1=Charte|first1=David|last2=Charte|first2=Francisco|last3=García|first3=Salvador|last4=Herrera|first4=Francisco|date=2019-04-01|title=A snapshot on nonstandard supervised learning problems: taxonomy, relationships, problem transformations and algorithm adaptations|url=https://doi.org/10.1007/s13748-018-00167-7|journal=Progress in Artificial Intelligence|language=en|volume=8|issue=1|pages=1–14|doi=10.1007/s13748-018-00167-7|arxiv=1811.12044|s2cid=53715158|issn=2192-6360}}&amp;lt;/ref&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== References ==&lt;br /&gt;
{{Reflist}}&lt;br /&gt;
&lt;br /&gt;
==See also==&lt;br /&gt;
*[[Approximation theory]]&lt;br /&gt;
*[[Fitness approximation]]&lt;br /&gt;
*[[Kriging]]&lt;br /&gt;
*[[Least squares (function approximation)]]&lt;br /&gt;
*[[Radial basis function network]]&lt;br /&gt;
&lt;br /&gt;
{{DEFAULTSORT:Function Approximation}}&lt;br /&gt;
[[Category:Regression analysis]]&lt;br /&gt;
[[Category:Statistical approximations]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{mathanalysis-stub}}&lt;br /&gt;
{{statistics-stub}}&lt;/div&gt;</summary>
		<author><name>93.99.190.128</name></author>
	</entry>
</feed>