A fast multi-level method for the fixed point form of matrix H-equations
- North Carolina State Univ., Raleigh (United States)
- Colby College, Waterville, ME (United States)
In previous work quasi-Newton and multi-level algorithms for fully nonlinear integral equations were designed and analyzed. The motivating examples for that work were analogs of the Chandrasekhar H-equation for matrix-valued functions. A weakness of these algorithms was that transfer between grids was done with a piecewise linear interpolation instead of Nystroem interpolation. This choice of interpolation was used because the nonlinearity in the Chandrasekhar equation was expressed in the quadratic form for which a matrix inversion is not required. In this paper the fixed point formulation is reconsidered and a conditioning issue associated with the matrix is resolved. This allows use of Nystroem interpolation and thereby a more efficient multi-level method. Implementation details on the Alliant FX series of multiprocessor computers is also discussed. 18 refs., 3 tabs.
- DOE Contract Number:
- W-31109-ENG-38
- OSTI ID:
- 6303133
- Journal Information:
- Transport Theory and Statistical Physics; (United States), Vol. 22:4; ISSN 0041-1450
- Country of Publication:
- United States
- Language:
- English
Similar Records
A portable parallel programs library for simulation and optimization in multiprocessor systems
PSolve: A concurrent algorithm for solving sparse systems of linear equations