GitHub

Methods Based on First-Order Approximation and Fixed-Point Methods

Consider the function f : R → R defined by f(x) = 0.25 cos(2x)^2 − x^2. Implement the methods of computing a root of the equation f(x) = 0 based on the first-order approximation of the function. In ...
GitHub

Numerical Methods for Polynomial Interpolation and Approximation

This Python script demonstrates several numerical methods for polynomial interpolation and approximation, including divided differences for Newton's interpolation, Hermite interpolation, and cubic ...
Scientific Research Publishing

Snyder, M.A. (1966) Chebyshev Methods in Numerical Approximation. Prentice-Hall, Inc., Englewood Cliffs.

ABSTRACT: Fractional differential equations have recently been applied in various areas of engineering, science, finance, applied mathematics, bio-engineering and others. However, many researchers ...
IEEE

High Precision Methods Based on Pade Approximation of Matrix Exponent for Numerical Analysis of Stiff-Oscillatory Electrical Circuits

Abstract: There are many numerical methods for the analysis of processes in electrical circuits and also many computer programs based on these methods, but these programs often reveal considerable ...
JSTOR Daily

NUMERICAL BOUNDARY CONDITIONS FOR THE FAST SWEEPING HIGH ORDER WENO METHODS FOR SOLVING THE EIKONAL EQUATION

Journal of Computational Mathematics, Vol. 26, No. 3, SPECIAL ISSUE DEDICATED TO THE 70TH BIRTHDAY OF PROFESSOR JUNZHI CUI (May 2008), pp. 336-346 (11 pages) High order fast sweeping methods have been ...