Choose an application
Numerical solutions of algebraic equations --- Differential equations, Nonlinear --- Differential equations, Partial --- Iterative methods (Mathematics) --- Numerical solutions. --- 517 <061.3> --- 681.3*G15 --- Analysis--?<061.3> --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Iterative methods (Mathematics). --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 517 <061.3> Analysis--?<061.3> --- Equations, Simultaneous --- Équations, Systèmes d' --- Équations, Systèmes d'. --- Analyse numérique. --- Numerical analysis --- Equations, Simultaneous. --- Analyse numérique --- Numerical analysis. --- Equations non lineaires --- Approximation des solutions
Choose an application
Equations, Roots of --- Fundamental theorem of algebra --- Congresses --- -Fundamental theorem of algebra --- -519.6 --- 681.3*G15 --- Algebra, Fundamental law of --- Algebra, Fundamental theorem of --- Fundamental law of algebra --- Numbers, Complex --- Roots of equations --- Computational mathematics. Numerical analysis. Computer programming --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Congresses. --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 519.6 --- Numerical analysis --- Equations, Theory of --- Analyse numérique --- Équations algébriques --- Analyse numérique. --- Équations algébriques. --- Analyse numérique. --- Equations, Theory of. --- Numerical analysis. --- Analyse numérique --- Equations, Roots of - Congresses --- Fundamental theorem of algebra - Congresses --- Equations algebriques
Choose an application
Engineering --- Mathematics --- 681.3*G12 --- 681.3*G15 --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 681.3*G12 Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Approximation: chebyshev; elementary function; least squares; linear approximation; minimax approximation and algorithms; nonlinear and rational approximation; spline and piecewise polynomial approximation (Numerical analysis) --- Data processing --- Computer. Automation
Choose an application
Numerical solutions of algebraic equations --- Iterative methods (Mathematics) --- Itération (Mathématiques) --- 519.6 --- 681.3*G13 --- 681.3*G15 --- Iteration (Mathematics) --- Numerical analysis --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Iterative methods (Mathematics). --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Itération (Mathématiques) --- Algebras, Linear --- Algèbre linéaire --- Analyse numérique --- Itération (mathématiques) --- Algèbre linéaire. --- Analyse numérique.
Choose an application
Here is an overview of modern computational stabilization methods for linear inversion, with applications to a variety of problems in audio processing, medical imaging, seismology, astronomy, and other areas. Rank-deficient problems involve matrices that are exactly or nearly rank deficient. Such problems often arise in connection with noise suppression and other problems where the goal is to suppress unwanted disturbances of given measurements. Discrete ill-posed problems arise in connection with the numerical treatment of inverse problems, where one typically wants to compute information about interior properties using exterior measurements. Examples of inverse problems are image restoration and tomography, where one needs to improve blurred images or reconstruct pictures from raw data. This book describes new and existing numerical methods for the analysis and solution of rank-deficient and discrete ill-posed problems. The emphasis is on insight into the stabilizing properties of the algorithms and the efficiency and reliability of the computations.
Equations, Simultaneous --- Iterative methods (Mathematics) --- Sparse matrices. --- Itération (Mathématiques) --- Matrices éparses --- Numerical solutions. --- 519.6 --- 681.3*G13 --- 517.95 --- #TELE:SISTA --- 681.3*G15 --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Partial differential equations --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 517.95 Partial differential equations --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Iterative methods (Mathematics). --- Itération (Mathématiques) --- Matrices éparses --- Sparse matrices --- Spare matrix techniques --- Matrices --- Iteration (Mathematics) --- Numerical analysis --- Numerical solutions --- Equations, Simultaneous - Numerical solutions.
Choose an application
Mathematical optimization --- Equations --- numerical solutions --- -Mathematical optimization --- 519.6 --- 681.3*G15 --- 681.3*G16 --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algebra --- Mathematics --- Numerical solutions --- Computational mathematics. Numerical analysis. Computer programming --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Graphic methods --- Equations - numerical solutions --- Programmation mathematique --- Equations non lineaires --- Methodes numeriques --- Approximation des solutions
Choose an application
Mathematical optimization --- Equations --- numerical solutions --- -Mathematical optimization --- 519.6 --- 681.3*G15 --- 681.3*G16 --- AA / International- internationaal --- 305.976 --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algebra --- Mathematics --- Numerical solutions --- Computational mathematics. Numerical analysis. Computer programming --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Algoritmen. Optimisatie. --- Mathematical optimization. --- Basic Sciences. Statistics --- Numerical solutions. --- Probability Theory, Sampling Theory --- Probability Theory, Sampling Theory. --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- Algoritmen. Optimisatie --- Graphic methods --- Equations - numerical solutions
Choose an application
Metric spaces --- Espaces métriques --- 517.982 --- #TCPW:boek --- 519.6 --- 681.3*G15 --- 681.3*G17 --- Linear spaces with topology and order or other structures --- Computational mathematics. Numerical analysis. Computer programming --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Ordinary differential equations: boundary value problems; convergence and stability; error analysis; initial value problems; multistep methods; single step methods; stiff equations (Numerical analysis) --- Metric spaces. --- 681.3*G17 Ordinary differential equations: boundary value problems; convergence and stability; error analysis; initial value problems; multistep methods; single step methods; stiff equations (Numerical analysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 517.982 Linear spaces with topology and order or other structures --- Spaces, Metric --- Generalized spaces --- Set theory --- Topology --- Espaces métriques.
Choose an application
519.61 --- 681.3*G15 --- 681.3*G16 --- 681.3*G17 --- 681.3*G17 Ordinary differential equations: boundary value problems convergence and stability error analysis initial value problems multistep methods single step methods stiff equations (Numerical analysis) --- Ordinary differential equations: boundary value problems convergence and stability error analysis initial value problems multistep methods single step methods stiff equations (Numerical analysis) --- 681.3*G16 Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- Optimization: constrained optimization gradient methods integer programming least squares methods linear programming nonlinear programming (Numericalanalysis) --- 681.3*G15 Roots of nonlinear equations: convergence error analysis iterative methodspolynomials (Numerical analysis) --- Roots of nonlinear equations: convergence error analysis iterative methodspolynomials (Numerical analysis) --- 519.61 Numerical methods of algebra --- Numerical methods of algebra --- Equations, Theory of. --- Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- Ordinary differential equations: boundary value problems; convergence and stability; error analysis; initial value problems; multistep methods; single step methods; stiff equations (Numerical analysis) --- 681.3*G17 Ordinary differential equations: boundary value problems; convergence and stability; error analysis; initial value problems; multistep methods; single step methods; stiff equations (Numerical analysis) --- 681.3*G16 Optimization: constrained optimization; gradient methods; integer programming; least squares methods; linear programming; nonlinear programming (Numericalanalysis) --- 681.3*G15 Roots of nonlinear equations: convergence; error analysis; iterative methods;polynomials (Numerical analysis) --- Algebras, Linear --- Equations, Theory of --- Numerical analysis --- 519.62 --- 519.62 Numerical methods for solution of ordinary differential equations --- Numerical methods for solution of ordinary differential equations --- Mathematical analysis --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Calculus of operations --- Line geometry --- Topology --- Numerical analysis. --- Algebras, Linear.
Choose an application
TheGer? sgorin CircleTheorem, averywell-known resultin linear algebra today, stems from the paper of S. Ger? sgorin in 1931 (which is reproduced in AppendixD)where,givenanarbitraryn×ncomplexmatrix,easyarithmetic operationsontheentriesofthematrixproducendisks,inthecomplexplane, whose union contains all eigenvalues of the given matrix. The beauty and simplicity of Ger? sgorin’s Theorem has undoubtedly inspired further research in this area, resulting in hundreds of papers in which the name “Ger? sgorin” appears. The goal of this book is to give a careful and up-to-date treatment of various aspects of this topic. The author ?rst learned of Ger? sgorin’s results from friendly conversations with Olga Taussky-Todd and John Todd, which inspired me to work in this area.Olgawasclearlypassionateaboutlinearalgebraandmatrixtheory,and her path-?nding results in these areas were like a magnet to many, including this author! It is the author’s hope that the results, presented here on topics related to Ger? sgorin’s Theorem, will be of interest to many. This book is a?ectionately dedicated to my mentors, Olga Taussky-Todd and John Todd. There are two main recurring themes which the reader will see in this book. The ?rst recurring theme is that a nonsingularity theorem for a mat- ces gives rise to an equivalent eigenvalue inclusion set in the complex plane for matrices, and conversely. Though common knowledge today, this was not widely recognized until many years after Ger? sgorin’s paper appeared. That these two items, nonsingularity theorems and eigenvalue inclusion sets, go hand-in-hand, will be often seen in this book.
Eigenvalues. --- Matric inequalities. --- Algebras, Linear. --- Gersgorin, Semen Aronovich, --- Algebra. --- Gers?gorin, Semen Aronovich, 1901-1933. --- Eigenvalues --- Matric inequalities --- Algebras, Linear --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Applied Mathematics --- Algebra --- 519.61 --- 512.62 --- 681.3*G15 --- 512.62 Fields. Polynomials --- Fields. Polynomials --- 519.61 Numerical methods of algebra --- Numerical methods of algebra --- Matrices --- Linear algebra --- Algebra, Universal --- Generalized spaces --- Mathematical analysis --- Calculus of operations --- Line geometry --- Topology --- Geršgorin, Semen Aronovich, --- Geršgorin, S. A. --- Numerical analysis. --- Numerical Analysis. --- Gersgorin, Semen Aronovich, - 1901-1933