Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions

Details Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions

2006-03-26

arxiv.org/abs/math/0603606v1

Mathematics

Numerical Analysis

10 pages. Based on a talk given at the Workshop on Symbolic Calculations and Exact Methods in Mathematical Physics, Kiev, June

Scientific paper

A new procedure is constructed by means of APS in APLAN language. The procedure solves the initial-value problem for linear differential equations of order $k$ with polynomial coefficients and regular singularity in the initialization point in the interval $[a, b]$ and computes the algebraic polynomial $y_n$ of given order $n$. A new algorithm of Lanczos $\tau$-method is built for this procedure, the solution existence $y_n$ of the initial-value problem proved on this algorithm and also is proved the optimality by precision of order $k$ derivative of the initial-value problem solution.

Affiliated with

Also associated with

No associations

Rating

Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Lanczos $τ$-method optimal algorithm in APS for approximating the mathematical functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607930