Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A Fortran program for discrete nonlinear Chebyshev approximation

From MaRDI portal
Publication:1155326
Jump to:navigation, search

DOI10.1016/0771-050X(80)90031-5zbMath0466.65013MaRDI QIDQ1155326

Charles B. Dunham

Publication date: 1980

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)


zbMATH Keywords

Fortran programRemez algorithmbest Chebyshev approximations


Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Software, source code, etc. for problems pertaining to numerical analysis (65-04)


Related Items (5)

Approximation with one (or few) parameters nonlinear ⋮ An algorithm for discrete nonlinear biased approximation ⋮ Unnamed Item ⋮ Algorithm 017 ⋮ The limit of discretization and weights increasing on nodes




Cites Work

  • Unnamed Item
  • Chebyshev approximation by exponential-polynomial sums
  • Discrete Chebyshev Approximation: Alternation and the Remez Algorithm




This page was built for publication: A Fortran program for discrete nonlinear Chebyshev approximation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1155326&oldid=13220175"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 04:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki