Monotone Iterations for Nonlinear Equations with Application to Gauss-seidel Methods
Monotone iterations for nonlinear equations with application to Gauss-Seidel methods
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Monotone iterations for nonlinear equations with application to Gauss-Seidel methods
Monotone iterations for nonlinear elliptic differential equations in boundary-value problems applied to Gauss-Seidel methods
Convergence theorems for Gauss-Seidel and other minimization algorithms
Class on nonlinear functions and convergence of Gauss-Seidel and Newton-Gauss-Seidel iterations
Explore the source record for details and available documents.
Three-dimensional target identification using scattering techniques requires high accuracy solutions and very fast computations for real-time predictions in some critical applications. We first train a deep neural operator (DeepONet) to solve wave propagation problems described by the Helmholtz equation in a domain without scatterers but at different wavenumbers and with a complex absorbing boundary condition. We then design two classes of fast meta-solvers by combining DeepONet with either relaxation methods, such as Jacobi and Gauss-Seidel, or with Krylov methods, such as GMRES and BiCGStab, using the trunk basis of DeepONet as a coarse-scale preconditioner. We leverage the spectral bias of neural networks to account for the lower part of the spectrum in the error distribution while the upper part is handled inexpensively using relaxation methods or fine-scale preconditioners. The meta-solvers are then applied to solve scattering problems with different shape of scatterers, at no extra training cost. We first demonstrate that the resulting meta-solvers are shape-agnostic, fast, and robust, whereas the standard standalone solvers may even fail to converge without the DeepONet. We then apply both classes of meta-solvers to scattering from a submarine, a complex three-dimensional problem. We achieve very fast solutions, especially with the DeepONet-Krylov methods, which require orders of magnitude fewer iterations than any of the standalone solvers.
Optimizing a particular subprogram out of the set of Basic (sparse) Linear Algebra Subprograms (BLAS) for a given architecture is a common topic of research. In applications, however, these BLAS functions rarely appear in isolation; usually, many of them are used together, in various combinations and with varying inputs. As the need to solve a large, sparse linear system is ubiquitous throughout HPC applications, linear solvers constitute a realistic, sufficiently complex and well-defined representative use case for composite BLAS routines. To this end, based on a representative set of matrices drawn from a diverse set of fields, we present a framework to study, from the performance and energy perspective, the efficacy of GPU- resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process. The development of this preconditioner was motivated by solving large graph Laplacian linear systems, for which the existing preconditioners either perform slow on GPU-based platforms or are not applicable. We compare the performance of these preconditioners on different hardware accelerator architectures, i.e., AMD MI250X, MI100, Nvidia A100, V100, and Jetson. Our experiments reveal performance trade-offs and provide information on how to select the best strategy for the given linear system, dictated by its properties, and the platform of interest. We demonstrate the application of our novel preconditioner for solving CG and graph Laplacian systems. Overall, the framework can be utilized as a benchmark to guide informed decisions in choosing a specific preconditioner, i.e., whether it is better to rely on the performance of a triangular solver or on the performance of sparse matrix-vector product. Finally, by considering power consumption to solve the linear systems, we report the energy footprint for the solvers.
A software framework to study, from the performance and energy perspective, the efficacy of GPU-resident parallel Conjugate Gradient (CG) linear solver with different preconditioner options, including Gauss-Seidel, Jacobi, and incomplete Cholesky. We also propose a novel GPU-based preconditioner, in which the triangular solves are approximated by an iterative process
HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.
Thermal batteries, also known as molten-salt batteries, are single-use reserve power systems activated by pyrotechnic heat generation, which transitions the solid electrolyte into a molten state. The simulation of these batteries relies on multiphysics modeling to evaluate performance and behavior under various conditions. This paper presents advancements in scalable preconditioning strategies for the Thermally Activated Battery Simulator (TABS) tool, enabling efficient solutions to the coupled electrochemical systems that dominate computational costs in thermal battery simulations. We propose a hierarchical block Gauss-Seidel preconditioner implemented through the Teko package in Trilinos, which effectively addresses the challenges posed by tightly coupled physics, including charge transport, porous flow, and species diffusion. The preconditioner leverages scalable subblock solvers, including smoothed aggregation algebraic multigrid (SA-AMG) methods and domain-decomposition techniques, to achieve robust convergence and parallel scalability. Strong and weak scaling studies demonstrate the solver’s ability to handle problem sizes up to 51.3 million degrees of freedom on 2048 processors, achieving near sub-second setup and solve times for the end-to-end electrochemical solve. These advancements significantly improve the computational efficiency and turnaround time of thermal battery simulations, paving the way for higher-resolution models and enabling the transition from 2D axisymmetric to full 3D simulations.
Nonlinear different equations, Gauss-Seidel or relaxation processes as methods for approximating solutions of nonlinear systems of equations
Computer program VARI-QUIR 3 provides Gauss-Seidel type of solution with inner and outer iterations for steady-state, multigroup, two-dimensional neutron diffusion equations. The program has no restrictions on any of the input parameters such as the number of groups, regions, or materials.
Asymptotic rate of convergence of Gauss-Seidel type iterative processes for nonlinear difference equations
Function classes of n-dimensional nonlinear mappings generalizing matrices, including convergence for Jacobi and Gauss-Seidel process
The structure of strong plane shock waves in a perfect monatomic gas was studied using four nonlinear models of the Boltzmann equation. The models involved the use of a simplified collision operator with velocity-independent collision frequency, in place of the complicated Boltzmann collision operator. The models employed were the BGK and ellipsoidal models developed by earlier authors, and the polynomial and trimodal gain function models developed during the work. An exact set of moment equations was derived for the density, velocity, temperature, viscous stress, and heat flux within the shock. This set was reduced to a pair of coupled nonlinear integral equations and solved using specially adapted numerical techniques. A new and simple Gauss-Seidel iteration was developed during the work and found to be as efficient as the best earlier iteration methods.
A numerical solution is presented for the incompressible flow over thin planar and axisymmetric profiles at an angle of attack of 0 degrees. The method uses a finite-difference field solution to the governing equation with a Gauss-Seidel successive overrelaxation scheme. However, the use of a simple Cartesian grid system restricts this method to slender profiles. Results are presented for a cambered airfoil, airfoil in wall effect (two-dimensional flowthrough inlet), body of revolution, and flowthrough nacelle. A computer program is presented which can be used for any of the previously mentioned cases with simple input changes. Results for compressible flow are available with the use of the appropriate two-dimensional or axisymmetric compressibility corrections. Computational time for a typical field calculation of 3000 grid points and 200 cycles through the field is less than 1 minute with less than 50,000 octal storage on the Control Data Corporation 6600 computing system.
An analysis is presented for the relaxation of a turbulent boundary layer on a semi-infinite flat plate after passage of a shock wave and a trailing driver gas-driven gas interface. The problem has special application to expansion-tube flows. The flow-governing equations have been transformed into the Crocco variables, and a time-similar solution is presented in terms of the dimensionless distance-time variable alpha and the dimensionless velocity variable beta. An eddy-viscosity model, similar to that of time-steady boundary layers, is applied to the inner and outer regions of the boundary layer. A turbulent Prandtl number equal to the molecular Prandtl number is used to relate the turbulent heat flux to the eddy viscosity. The numerical results, obtained by using the Gauss-Seidel line-relaxation method, indicate that a fully turbulent boundary layer relaxes faster to the final steady-state values of heat transfer and skin friction than a laminar boundary layer. The results also give a fairly good estimate of the local skin friction and heat transfer for near steady-flow conditions.
An analytic investigation of the relaxation of the accelerating-gas boundary layer to the test-gas boundary layer over a flat plate mounted in an expansion tube has been conducted. In this treatment, nitrogen has been considered as the test gas and helium as the accelerating gas. The problem is analyzed in two conically similar limits: (1) when the time lag between the arrival of the shock and the interface at the leading edge of the plate is very large, and (2) when this time lag is negligible. The transient laminar boundary-layer equations of a perfect binary-gas mixture are taken as the flow governing equations. These coupled equations have been solved numerically by Gauss-Seidel line-relaxation method. The results predict the transient behavior as well as the time required for an all-helium accelerating-gas boundary layer to relax to an all-nitrogen boundary layer.