System of linear equations

About: System of linear equations is a research topic. Over the lifetime, 14630 publications have been published within this topic receiving 311975 citations. The topic is also known as: linear system & linear system of equations.

Theory of Linear and Integer Programming

Abstract: Introduction and Preliminaries. Problems, Algorithms, and Complexity. LINEAR ALGEBRA. Linear Algebra and Complexity. LATTICES AND LINEAR DIOPHANTINE EQUATIONS. Theory of Lattices and Linear Diophantine Equations. Algorithms for Linear Diophantine Equations. Diophantine Approximation and Basis Reduction. POLYHEDRA, LINEAR INEQUALITIES, AND LINEAR PROGRAMMING. Fundamental Concepts and Results on Polyhedra, Linear Inequalities, and Linear Programming. The Structure of Polyhedra. Polarity, and Blocking and Anti--Blocking Polyhedra. Sizes and the Theoretical Complexity of Linear Inequalities and Linear Programming. The Simplex Method. Primal--Dual, Elimination, and Relaxation Methods. Khachiyana s Method for Linear Programming. The Ellipsoid Method for Polyhedra More Generally. Further Polynomiality Results in Linear Programming. INTEGER LINEAR PROGRAMMING. Introduction to Integer Linear Programming. Estimates in Integer Linear Programming. The Complexity of Integer Linear Programming. Totally Unimodular Matrices: Fundamental Properties and Examples. Recognizing Total Unimodularity. Further Theory Related to Total Unimodularity. Integral Polyhedra and Total Dual Integrality. Cutting Planes. Further Methods in Integer Linear Programming. References. Indexes.

Linear and Quasi-linear Equations of Parabolic Type

Abstract: Introductory material Auxiliary propositions Linear equations with discontinuous coefficients Linear equations with smooth coefficients Quasi-linear equations with principal part in divergence form Quasi-linear equations of general form Systems of linear and quasi-linear equations Bibliography.

Applied Numerical Linear Algebra

Abstract: Preface 1. Introduction 2. Linear equation solving 3. Linear least squares problems 4. Nonsymmetric Eigenvalue problems 5. The symmetric Eigenproblem and singular value decomposition 6. Iterative methods for linear systems 7. Iterative methods for Eigenvalue problems Bibliography Index.

For most large underdetermined systems of linear equations the minimal 1-norm solution is also the sparsest solution

Abstract: We consider linear equations y = Φx where y is a given vector in ℝn and Φ is a given n × m matrix with n 0 so that for large n and for all Φ's except a negligible fraction, the following property holds: For every y having a representation y = Φx0by a coefficient vector x0 ∈ ℝmwith fewer than ρ · n nonzeros, the solution x1of the 1-minimization problem is unique and equal to x0. In contrast, heuristic attempts to sparsely solve such systems—greedy algorithms and thresholding—perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost-spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices. © 2006 Wiley Periodicals, Inc.

Dynamic Equations on Time Scales: An Introduction with Applications

Abstract: Preface * The Time Scales Calculus * First Order Linear Equations * Second Order Linear Equations * Self-Adjoint Equations * Linear Systems and Higher Order Equations * Dynamic Inequalities * Linear Symplectic Dynamic Systems * Extensions * Solutions to Selected Problems * Bibliography * Index