Direct Methods for Sparse Matrices Direct Methods for Sparse Matrices

Direct Methods for Sparse Matrices

I. S. Duff and Others
    • $109.99
    • $109.99

Publisher Description

The subject of sparse matrices has its root in such diverse fields as management science, power systems analysis, surveying, circuit theory, and structural analysis. Efficient use of sparsity is a key to solving large problems in many fields. This book provides both insight and answers for those attempting to solve these problems.

GENRE
Science & Nature
RELEASED
2017
February 10
LANGUAGE
EN
English
LENGTH
416
Pages
PUBLISHER
OUP Oxford
SELLER
The Chancellor, Masters and Scholars of the University of Oxford trading as Oxford University Press
SIZE
14.2
MB

More Books Like This

Branch-and-Bound Applications in Combinatorial Data Analysis Branch-and-Bound Applications in Combinatorial Data Analysis
Branch-and-Bound Applications in Combinatorial Data Analysis
2006
Operations Research and Cyber-Infrastructure Operations Research and Cyber-Infrastructure
Operations Research and Cyber-Infrastructure
2009
The Linear Ordering Problem The Linear Ordering Problem
The Linear Ordering Problem
2011
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2011
Handbook on Modelling for Discrete Optimization Handbook on Modelling for Discrete Optimization
Handbook on Modelling for Discrete Optimization
2006
Models and Algorithms for Global Optimization Models and Algorithms for Global Optimization
Models and Algorithms for Global Optimization
2007