Lanczos τ-method optimal algorithm in APS for approximating the mathematical functions
P. N. Denisenko
Abstract
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 yn of given order n. A new algorithm of Lanczos τ-method is built for this procedure, the solution existence yn 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.
Create a lesson
Related papers
A Multilevel Interacting Particle System Method for the estimation of Failure Probabilities
Rubén Aylwin, José Pinto
Enforcing Dirichlet Boundary Conditions in Operator Learning
Andrew M. Stuart, Margaret Trautner
QH-GEM: Quantum-Hydrodynamic Generative Modeling
Harbir Antil, Alex Kaltenbach, Sarswati Shah
Bochner Stability for B-stable DIRK Schemes
Anthony E. Ramirez, Abner J. Salgado
A multi-class kinetic traffic flow model: discrete-velocity formulation and diffusively-corrected macroscopic limits
Carmen Mezquita-Nieto, Paola Goatin, Axel Klar
Primal-dual methods and acceleration for Morozov and equality constrained regularization
Diana-Elena Mirciu, Martin Benning, Elena Resmerita