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

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…