Gaussian elimination for sparse linear equations

Author(s):  
Arieh Iserles
2020 ◽  
Vol 6 (6) ◽  
pp. 1074-1090
Author(s):  
Nassrin Jassim Hussien Al-Mansori ◽  
Laith Shaker Ashoor Al-Zubaidi

Forecasting techniques are essential in the planning, design, and management of water resource systems. The numerical model introduced in this study turns governing differential equations into systems of linear or non-linear equations in the flow field, thereby revealing solutions. This one-dimensional hydrodynamic model represents the varied unsteady flow found in natural channels based on the Saint-Venant Equations. The model consists of the equations for the conservation of mass and momentum, which are recognized as very powerful mathematical tools for studying an important class of water resource problems. These problems are characterized by time dependence of flow and cover a wide range of phenomena. The formulations, held up by the four-point implicit finite difference scheme, solve the nonlinear system of equations using the Newton-Raphson iteration method with a modified Gaussian elimination technique. The model is calibrated using data on the Euphrates River during the early spring flood in 2015. It is verified by its application to an ideal canal and to the reach selected at the Euphrates River; this application is also used to predict the effect of hydraulic parameters on the river’s flow characteristics. A comparison between model results and field data indicates the feasibility of our technique and the accuracy of results (R2 = 0.997), meaning that the model is ready for future application whenever field observations are available. 


2006 ◽  
Vol 11 (2) ◽  
pp. 123-136 ◽  
Author(s):  
A. G. Akritas ◽  
G. I. Malaschonok ◽  
P. S. Vigklas

Given an m × n matrix A, with m ≥ n, the four subspaces associated with it are shown in Fig. 1 (see [1]). Fig. 1. The row spaces and the nullspaces of A and AT; a1 through an and h1 through hm are abbreviations of the alignerframe and hangerframe vectors respectively (see [2]). The Fundamental Theorem of Linear Algebra tells us that N(A) is the orthogonal complement of R(AT). These four subspaces tell the whole story of the Linear System Ax = y.  So, for example, the absence of N(AT) indicates that a solution always exists, whereas the absence of N(A) indicates that this solution is unique. Given the importance of these subspaces, computing bases for them is the gist of Linear Algebra. In “Classical” Linear Algebra, bases for these subspaces are computed using Gaussian Elimination; they are orthonormalized with the help of the Gram-Schmidt method. Continuing our previous work [3] and following Uhl’s excellent approach [2] we use SVD analysis to compute orthonormal bases for the four subspaces associated with A, and give a 3D explanation. We then state and prove what we call the “SVD-Fundamental Theorem” of Linear Algebra, and apply it in solving systems of linear equations.


1976 ◽  
Vol 54 (19) ◽  
pp. 1925-1936 ◽  
Author(s):  
D. K. Lam ◽  
H. G. Schmidt-Weinmar ◽  
A. Wouk

We present a fast computer algorithm to solve the scalar inverse scattering problem numerically by inverting a linear transformation which maps a 3-D distribution of scattering sources into the angular distribution of the resultant scattered far field. We show how an approximate solution to the problem can be found in discrete form which leads to non-singular systems of linear equations of a type whose matrix can be inverted readily by fast algorithms.The method uses Born's first approximation and is valid for a slowly varying refractive index: the resultant numerical problem can be solved by a fast algorithm which reduces computing time by ~10−7, storage requirement by ~10−5, as compared with Gaussian elimination applied to 125 000 sample points. With this algorithm, computerized 3-D reconstruction becomes feasible.


2003 ◽  
Vol 01 (01) ◽  
pp. 41-69 ◽  
Author(s):  
JING LI ◽  
TAO JIANG

We study haplotype reconstruction under the Mendelian law of inheritance and the minimum recombination principle on pedigree data. We prove that the problem of finding a minimum-recombinant haplotype configuration (MRHC) is in general NP-hard. This is the first complexity result concerning the problem to our knowledge. An iterative algorithm based on blocks of consecutive resolved marker loci (called block-extension) is proposed. It is very efficient and can be used for large pedigrees with a large number of markers, especially for those data sets requiring few recombinants (or recombination events). A polynomial-time exact algorithm for haplotype reconstruction without recombinants is also presented. This algorithm first identifies all the necessary constraints based on the Mendelian law and the zero recombinant assumption, and represents them using a system of linear equations over the cyclic group Z2. By using a simple method based on Gaussian elimination, we could obtain all possible feasible haplotype configurations. A C++ implementation of the block-extension algorithm, called PedPhase, has been tested on both simulated data and real data. The results show that the program performs very well on both types of data and will be useful for large scale haplotype inference projects.


Author(s):  
Ali H. M. Murid ◽  
Mohmed M. A. Alagele ◽  
Mohamed M. S. Nasser

This research is about computing the Green’s functions on simply connected regions by using the method of boundary integral equation. The method depends on solving a Dirichlet problem using a uniquely solvable Fredholm integral equation on the boundary of the region. The kernel of this integral equation is the generalized Neumann kernel. The numerical method for solving this integral equation is the Nystrӧm method with trapezoidal rule which leads to a system of linear equations. The linear system is then solved by the Gaussian elimination method. Mathematica plot of Green’s function for atest region is also presented.


Sign in / Sign up

Export Citation Format

Share Document