Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Railway Computation for Infinite Linear Systems
by
Lotti, Grazia
, Romani, Francesco
, Favati, Paola
, Menchi, Ornella
in
Studies
2002
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Railway Computation for Infinite Linear Systems
by
Lotti, Grazia
, Romani, Francesco
, Favati, Paola
, Menchi, Ornella
in
Studies
2002
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Railway Computation for Infinite Linear Systems
2002
Request Book From Autostore
and Choose the Collection Method
Overview
The problem of solving an infinite system of linear equations finitely expressed is addressed. Modifications of the Gauss-Seidel method are presented, especially suitable for the implementation of SMP machines with a small number of processors. One of the proposed parallel algorithms, which concentrates the computational efforts where they are most needed, results to be more efficient than the sequential algorithm, even from the point of view of the total number of operations.
Publisher
Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.