Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2005
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2005

[Date Index] [Thread Index] [Author Index]

Search the Archive

MiniMaxApproximation question

  • To: mathgroup at smc.vnet.net
  • Subject: [mg61908] MiniMaxApproximation question
  • From: michael_chang86 at hotmail.com
  • Date: Fri, 4 Nov 2005 05:11:29 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

Hi,

I'm using Mathematica 5.2, and was wondering if one easily can obtain a
rational (preferably with degree(denominator)=0) mini-max polynomial
approximation of a function f[x] (à la MiniMaxApproximation), where
the *absolute* error is minimized over a finite region.  A quick
perusal of the documentation for MiniMaxApproximation indicates that
the *relative* error is optimized.

Specifically, I would like to obtain an optimal (with regards to the
*absolute* error) approximation  of:

x^d, x \in [0,1], 0<d<\infty.

One can, of course, obtain a simple polynomial approximation using
Chebyshev's discrete interpolation formula (after a simple
translation), but I was wondering if one can easily improve the
(absolute error) approximation via MiniMaxApproximation (or some other
unknown variant thereof).

Many thanks in advance!

Michael


  • Prev by Date: Logical Circuit Diagrams or Characters
  • Next by Date: Use of Mathematica with Rule-based Equation Derivations
  • Previous by thread: Logical Circuit Diagrams or Characters
  • Next by thread: Re: MiniMaxApproximation question