Published December 1983
| Version Published
Journal Article
Open
The Bordering Algorithm and Path Following Near Singular Points of Higher Nullity
Creators
Abstract
We study the behavior of the bordering algorithm (a form of block elimination) for solving nonsingular linear systems with coefficient matrices in the partitioned form (A & B \\ C^* & D) when N(A)≧1. Systems with this structure naturally occur in path following procedures. We show that under appropriate assumptions, the algorithm, which is based on solving systems with coefficient matrix A, works as A varies along a path and goes through singular points. The required assumptions are justified for a large class of problems coming from discretizations of boundary value problems for differential equations.
Additional Information
© 1983 Society for Industrial and Applied Mathematics. Received by the editors March 15, 1982, and in revised form July 26, 1982. This work was supported by the U.S. Department of Energy under contract EY-76-S-03-0767, Project agreement #12, and the U.S. Army Research Office under contract DAAG 29-78-C-0011. I wish to thank the referees for helpful comments on the original version of this paper.Attached Files
Published - KELsiamjssc83.pdf
Files
KELsiamjssc83.pdf
Files
(930.5 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:63da50d882e0f7df8a8f7bb6f73405e5
|
930.5 kB | Preview Download |
Additional details
Identifiers
- Eprint ID
- 32395
- Resolver ID
- CaltechAUTHORS:20120712-141249734
Funding
- Department of Energy (DOE)
- EY-76-S-03-0767
- Army Research Office (ARO)
- DAAG 29-78-C-0011
Dates
- Created
-
2012-07-12Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field