Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A faster algorithm for solving linear algebraic equations on the star graph.

From MaRDI portal
Publication:1398781
Jump to:navigation, search

DOI10.1016/S0743-7315(03)00031-5zbMath1055.68161OpenAlexW2001687728MaRDI QIDQ1398781

C. Siva Ram Murthy, Ramesh Chandra

Publication date: 7 August 2003

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-7315(03)00031-5


zbMATH Keywords

Gaussian eliminationLinear systemMatrix decompositionParallel algorithmStar graph


Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)


Related Items (2)

Largest connected component of a star graph with faulty vertices ⋮ A parallel approach for determining confidence intervals of variable statistics in large and sparse linear equations with RHS ranges




This page was built for publication: A faster algorithm for solving linear algebraic equations on the star graph.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1398781&oldid=13553165"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 16:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki