scispace - formally typeset
Open AccessBook

Applied Numerical Linear Algebra

Reads0
Chats0
TLDR
The symmetric Eigenproblem and singular value decomposition and the Iterative methods for linear systems Bibliography Index.
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.

read more

Citations
More filters
Book

Distributed Optimization and Statistical Learning Via the Alternating Direction Method of Multipliers

TL;DR: It is argued that the alternating direction method of multipliers is well suited to distributed convex optimization, and in particular to large-scale problems arising in statistics, machine learning, and related areas.
Book

Graphical Models, Exponential Families, and Variational Inference

TL;DR: The variational approach provides a complementary alternative to Markov chain Monte Carlo as a general source of approximation methods for inference in large-scale statistical models.
Journal ArticleDOI

Advances in methods and algorithms in a modern quantum chemistry program package

TL;DR: Specific developments discussed include fast methods for density functional theory calculations, linear scaling evaluation of energies, NMR chemical shifts and electric properties, fast auxiliary basis function methods for correlated energies and gradients, equation-of-motion coupled cluster methods for ground and excited states, geminal wavefunctions, embedding methods and techniques for exploring potential energy surfaces.
Book

Parameter estimation and inverse problems

TL;DR: "Parameter Estimation and Inverse Problems, 2/e" introduces readers to both Classical and Bayesian approaches to linear and nonlinear problems with particular attention paid to computational, mathematical, and statistical issues related to their application to geophysical problems.
Journal ArticleDOI

An Interior-Point Method for Large-Scale $\ell_1$ -Regularized Least Squares

TL;DR: In this paper, the preconditioned conjugate gradients (PCG) algorithm is used to compute the search direction for sparse least-squares programs (LSPs), which can be reformulated as convex quadratic programs, and then solved by several standard methods such as interior-point methods.