Poštovani korisnici, zbog državnog praznika korisnička podrška danas nije dostupna. Na vaše zahtjeve odgovorit ćemo sljedeći radni dan. Hvala vam na razumijevanju.

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € Pošta 4.99 € Overseas 4.99 € Box Now 4.49 € GLS 4.99 € DPD točka 3.49 € GLS paketomat 3.99 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Poštovani korisnici, zbog državnog praznika korisnička podrška danas nije dostupna. Na vaše zahtjeve odgovorit ćemo sljedeći radni dan. Hvala vam na razumijevanju.

Besplatna dostava putem Box Now paketomata i Overseas kurirske službe iznad 69,99 €.

Algorithms for Sparse Linear Systems

Name: Algorithms for Sparse Linear Systems
Brand: Springer Nature B.V.
SKU: 43417915
Price: 56.88 EUR
Availability: InStock
Author: Scott Jennifer Scott
ISBN: 9783031258213

Scott Jennifer Scott

Tuma Miroslav Tuma

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 43417915

Nakladnici Springer Nature B.V., svibanj 2023

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This ope... Cijeli opis

Libristo kod: 43417915

138 b

Top

56.88 €

Vanjske zalihe Šaljemo za 10-18 dana

30 dana za povrat kupljenih proizvoda

Kupci su kupili i

Iterative Methods for Sparse Linear Systems Yousef Saad

Meki uvez

129.24 €

Helluva Boss Nendoroid Action Figure Blitzo 10 cm Igra/Igračka

Igračka

77.60 €

Monster High POP! Vinyl Figure Skelita 9 cm Igra/Igračka

Igračka

21.62 €

Lo spazio del teatro Fabrizio Cruciani

Meki uvez

21.51 €

Memoires, Correspondance Et Manuscrits Du General La Fayette. T6 (Ed.1837-1838) Gilbert Du Motier La Fayette

Meki uvez

44.05 €

Large sparse linear systems of equations are ubiquitous in science, engineering and beyond. This open access monograph focuses on factorization algorithms for solving such systems. It presents classical techniques for complete factorizations that are used in sparse direct methods and discusses the computation of approximate direct and inverse factorizations that are key to constructing general-purpose algebraic preconditioners for iterative solvers. A unified framework is used that emphasizes the underlying sparsity structures and highlights the importance of understanding sparse direct methods when developing algebraic preconditioners. Theoretical results are complemented by sparse matrix algorithm outlines.

This monograph is aimed at students of applied mathematics and scientific computing, as well as computational scientists and software developers who are interested in understanding the theory and algorithms needed to tackle sparse systems. It is assumed that the reader has completed a basic course in linear algebra and numerical mathematics.