Image from Google Jackets

Image from OpenLibrary

Normal view MARC view ISBD view

An algorithm for finding a few extreme generalized eigenpairs of a sparse symmetric positive definite matrix pencil

By:

Axelsson, O [Author]

Material type: Text

Text

TextSeries: Report 9530Publication details: Nijmegen: Catholic University, Department of Mathematics, 1995.Description: 24p. 24cmSubject(s):

LOC classification:

MATH QA3.R46 no.9530

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Research Report	UDSM Library	Mathematics Department	MATH QA3.R46 no.9530 (Browse shelf(Opens below))	Available		000000202159

Browsing Directorate of Library Services (UDSM) shelves, Collection: Mathematics Department Close shelf browser (Hides shelf browser)

Previous	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	No cover image available No cover image available	Next
Previous	MATH QA3.R46 no.9527 Random polymers	MATH QA3.R46 no.9528 Formal solutions and factorization of differential operators with power series coefficients	MATH QA3.R46 no.9529 The extreme points of a class of functions with positive real part	MATH QA3.R46 no.9530 An algorithm for finding a few extreme generalized eigenpairs of a sparse symmetric positive definite matrix pencil	MATH QA3.R46 no.9531 Polynomial estimators of minimal variance	MATH QA3.R46 no.9532 Preconditioning of indefinite and almost singular finite element elliptic equations	MATH QA3.R46 no.9533 A robust hierachical basis preconditioner on general meshes	Next

Includes bibliographical references

There are no comments on this title.

to post a comment.