A numerical method for solving linear integrodifferential equations with variable limits is built up by using efficient IVP solvers coupled with a bi-conjugate gradient technique to iterate the resulting functional equation. The method is easy to implement and applicable to a wide class of problems.
A fast algorithm for solving systems of linear equations with two variables per equation
β Scribed by Bengt Aspvall; Yossi Shiloach
- Publisher
- Elsevier Science
- Year
- 1980
- Tongue
- English
- Weight
- 531 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper presents efficient hypercube algorithms for solving triangular systems of linear equations by using various matrix partitioning and mapping schemes. Recently, several parallel algorithms have been developed for this problem. In these algorithms, the triangular solver is treated as the sec
## Abstract An algorithm based on a small matrix approach to the solution of a system of inhomogeneous linear algebraic equations is developed and tested in this short communication. The solution is assumed to lie in an initial subspace and the dimension of the subspace is augmented iteratively by
Spectral algorithms offer very high spatial resolution for a wide range of nonlinear wave equations on periodic domains, including well-known cases such as the Korteweg-de Vries and nonlinear SchrΓΆdinger equations. For the best computational efficiency, one needs also to use high-order methods in ti