An integration-free algorithm for the solution of regular boundary value problems: Space pruning approach (Q758142): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4877167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3848368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4185363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5567395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characteristic function approach to the discrete spectrum of electrically charged particles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279399 / rank
 
Normal rank

Revision as of 15:07, 21 June 2024

scientific article
Language Label Description Also known as
English
An integration-free algorithm for the solution of regular boundary value problems: Space pruning approach
scientific article

    Statements

    An integration-free algorithm for the solution of regular boundary value problems: Space pruning approach (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The authors construct an algebraic method to determine the discrete spectrum of a linear differential operator appearing in regular boundary value problems. The method is based on the pruning of a linear vector space towards the domain of the operator under consideration. Its convergence can be accelerated either by choosing an appropriate basis set or by removing fluctuations. The efficiency of the method is demonstrated on a simple test problem.
    0 references
    integration-free algorithm
    0 references
    space pruning approach
    0 references
    convergence acceleration
    0 references
    algebraic method
    0 references
    discrete spectrum
    0 references
    linear differential operator
    0 references
    efficiency
    0 references
    test problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers