Listing 1 - 10 of 16 | << page >> |
Sort by
|
Choose an application
Results of research into large scale eigenvalue problems are presented in this volume. The papers fall into four principal categories:novel algorithms for solving large eigenvalue problems, novel computer architectures, computationally-relevant theoretical analyses, and problems where large scale eigenelement computations have provided new insight.
Eigenvalues --- Data processing --- Matrices --- Congresses
Choose an application
In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;methods for low-rank
Nonlinear systems --- Mathematical models. --- Systems, Nonlinear --- System theory --- Calculus of variations. --- Eigenvalues. --- Calculus of variations --- Eigenvalues
Choose an application
This monograph provides a comprehensive treatment of expansion theorems for regular systems of first order differential equations and n-th order ordinary differential equations.In 10 chapters and one appendix, it provides a comprehensive treatment from abstract foundations to applications in physics and engineering. The focus is on non-self-adjoint problems. Bounded operators are associated to these problems, and Chapter 1 provides an in depth investigation of eigenfunctions and associated functions for bounded Fredholm valued operators in Banach spaces. Since every n-th orde
Boundary value problems. --- Nonselfadjoint operators. --- Eigenvalues. --- Differential equations.
Choose an application
Multiparameter eigenvalue problems
Differential equations. --- Eigenvalues. --- Inverse problems (Differential equations). --- Matrices. --- Operator theory. --- Spectral theory (Mathematics). --- Sturm-Liouville equation. --- Algebras, Linear. --- Compact operators --- Algèbre linéaire --- Matrices --- Opérateurs compacts --- Valeurs propres --- Eigenvalues --- Differential equations
Choose an application
The basic goals of the book are: (i) to introduce the subject to those interested in discovering it, (ii) to coherently present a number of basic techniques and results, currently used in the subject, to those working in it, and (iii) to present some of the results that are attractive in their own right, and which lend themselves to a presentation not overburdened with technical machinery.
Differential equations, Partial. --- Eigenvalues. --- Geometry, Riemannian. --- Riemann geometry --- Riemannian geometry --- Generalized spaces --- Geometry, Non-Euclidean --- Semi-Riemannian geometry --- Matrices --- Partial differential equations --- Differential equations, Partial --- Eigenvalues --- Geometry, Riemannian --- Equations aux dérivées partielles --- Valeurs propres --- Riemann, Géométrie de
Choose an application
Matrix Singular Value Decomposition (SVD) and its application to problems in signal processing is explored in this book. The papers discuss algorithms and implementation architectures for computing the SVD, as well as a variety of applications such as systems and signal modeling and detection. The publication presents a number of keynote papers, highlighting recent developments in the field, namely large scale SVD applications, isospectral matrix flows, Riemannian SVD and consistent signal reconstruction. It also features a translation of a historical paper by Eugenio Beltrami, containing on
Signal processing --- Decomposition (Mathematics) --- Digital techniques --- Congresses --- -Signal processing --- -Academic collection --- #TELE:SISTA --- 519.6 --- 681.3*G13 --- Processing, Signal --- Information measurement --- Signal theory (Telecommunication) --- Mathematics --- Probabilities --- -Congresses --- Computational mathematics. Numerical analysis. Computer programming --- 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 --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- Academic collection --- Digital techniques&delete& --- Decomposition (Mathematics) - Congresses. --- Signal processing - Digital techniques - Congresses --- Decomposition (Mathematics) - Congresses --- Signals --- Processing
Choose an application
Assume that after preconditioning we are given a fixed point problem x = Lx + f (*) where L is a bounded linear operator which is not assumed to be symmetric and f is a given vector. The book discusses the convergence of Krylov subspace methods for solving fixed point problems (*), and focuses on the dynamical aspects of the iteration processes. For example, there are many similarities between the evolution of a Krylov subspace process and that of linear operator semigroups, in particular in the beginning of the iteration. A lifespan of an iteration might typically start with a fast but slowing phase. Such a behavior is sublinear in nature, and is essentially independent of whether the problem is singular or not. Then, for nonsingular problems, the iteration might run with a linear speed before a possible superlinear phase. All these phases are based on different mathematical mechanisms which the book outlines. The goal is to know how to precondition effectively, both in the case of "numerical linear algebra" (where one usually thinks of first fixing a finite dimensional problem to be solved) and in function spaces where the "preconditioning" corresponds to software which approximately solves the original problem.
Convergence --- Equations --- Iterative methods (Mathematics) --- Convergence (Mathématiques) --- Itération (Mathématiques) --- Numerical solutions --- Solutions numériques --- 517.98 --- 519.6 --- 681.3*G13 --- Functional analysis and operator theory --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 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 --- 517.98 Functional analysis and operator theory --- Convergence (Mathématiques) --- Itération (Mathématiques) --- Solutions numériques --- Convergence. --- Numerical solutions.
Choose an application
The solutions of systems of linear and nonlinear equations occurs in many situations and is therefore a question of major interest. Advances in computer technology has made it now possible to consider systems exceeding several hundred thousands of equations. However, there is a crucial need for more efficient algorithms.
The main focus of this book (except the last chapter, which is devoted to systems of nonlinear equations) is the consideration of solving the problem of the linear equation
The book is intended for students and researchers in numerical analysis and for practitioners and engineers who require the most recent methods for solving their particular problem.
Lineaire vergelijkingen. --- Projectiemethoden (wiskunde) --- Equations, Simultaneous --- Iterative methods (Mathematics) --- Itération (Mathématiques) --- Numerical solutions. --- -Iterative methods (Mathematics) --- #TELE:SISTA --- 519.6 --- 681.3*G13 --- Iteration (Mathematics) --- Numerical analysis --- Simultaneous equations --- Numerical solutions --- Computational mathematics. Numerical analysis. Computer programming --- Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 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 --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Equations, Simultaneous - Numerical solutions.
Choose an application
Sparse matrices
Numerical analysis --- Sparse matrices. --- Matrices éparses. --- Analyse numérique. --- Algèbre linéaire. --- Algebras, Linear --- Matrices --- Algebra, Universal. --- Data processing. --- Data processing --- 519.6 --- 681.3*G13 --- 681.3*G13 Numerical linear algebra: conditioning; determinants; Eigenvalues; error analysis; linear systems; matrix inversion; pseudoinverses; sparse and very largesystems --- 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 --- Computational mathematics. Numerical analysis. Computer programming --- Algebra, Multiple --- Multiple algebra --- N-way algebra --- Universal algebra --- Algebra, Abstract --- Numbers, Complex --- Analyse numérique --- Algèbre linéaire --- Numerical analysis. --- Algebras, Linear. --- Matrices - Data processing --- Calcul matriciel --- Methodes numeriques
Choose an application
Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling. SLS algorithms have also become increasingly popular for solving challenging combinatorial problems in many application areas, such as e-commerce and bioinformatics.Hoos and Stützle offer the first systematic and unified treatment of SLS algorithms. In this groundbreaking new book, they examine the
Stochastic programming --- Algorithms --- Combinatorial analysis --- Programmation stochastique --- Algorithmes --- Analyse combinatoire --- 681.3*G13 --- Numerical linear algebra: conditioning; determinants; eigenvalues and eigenvectors; error analysis; linear systems; matrix inversion; pseudoinverses; singular value decomposition; sparse, structured, and very large systems (direct and iterative methods) --- Linear programming --- Combinatorics --- Algebra --- Mathematical analysis --- Algorism --- Arithmetic --- Foundations --- Algorithmes. --- Programmation stochastique. --- Analyse combinatoire. --- Algorithms. --- Combinatorial analysis. --- Stochastic programming.
Listing 1 - 10 of 16 | << page >> |
Sort by
|