1 Factorization-based Sparse Solvers and Preconditioners (4th Gene Golub SIAM Summer School, 2013)

First Page		Document Content
Date: 2015-07-29 21:36:24 Numerical linear algebra Algebra Linear algebra Numerical analysis Parallel computing Matrix Sparse matrix LU decomposition Basic Linear Algebra Subprograms Data parallelism Cholesky decomposition General-purpose computing on graphics processing units		1 Factorization-based Sparse Solvers and Preconditioners (4th Gene Golub SIAM Summer School, 2013) Add to Reading List Source URL: crd-legacy.lbl.gov Download Document from Source Website File Size: 403,91 KB Share Document on Facebook

	The Schur algebra is not spectral in B(`2). Romain Tessera∗ July 31, 2009 Abstract We give an example of an infinite matrix whose rows and columns DocID: 1xVrQ - View Document
	Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics DocID: 1xVg5 - View Document
	THE EXT ALGEBRA OF A QUANTIZED CYCLE DAMIEN CALAQUE AND JULIEN GRIVAUX Abstract. Given a quantized analytic cycle (X, σ) in Y, we give a categorical Lie-theoretic interpretation of a geometric condition, discovered by S DocID: 1xV3t - View Document
	Evaluation of RSVP and Mobility-aware RSVP Using Performance Evaluation Process Algebra Hao Wang and David I. Laurenson Jane Hillston DocID: 1xUMp - View Document
	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document