Introduction to the Numerical Solution of Markov Chains:
A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Princeton, NJ
Princeton University Press
[2021]
|
Schlagworte: | |
Online-Zugang: | FAW01 FAB01 FCO01 FHA01 FKE01 FLA01 UPA01 Volltext |
Zusammenfassung: | A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however, it is necessary to understand how Markov chains can be solved numerically. In this book, the first to offer a systematic and detailed treatment of the numerical solution of Markov chains, William Stewart provides scientists on many levels with the power to put this theory to use in the actual world, where it has applications in areas as diverse as engineering, economics, and education. His efforts make for essential reading in a rapidly growing field. Here Stewart explores all aspects of numerically computing solutions of Markov chains, especially when the state is huge. He provides extensive background to both discrete-time and continuous-time Markov chains and examines many different numerical computing methods--direct, single-and multi-vector iterative, and projection methods. More specifically, he considers recursive methods often used when the structure of the Markov chain is upper Hessenberg, iterative aggregation/disaggregation methods that are particularly appropriate when it is NCD (nearly completely decomposable), and reduced schemes for cases in which the chain is periodic. There are chapters on methods for computing transient solutions, on stochastic automata networks, and, finally, on currently available software. Throughout Stewart draws on numerous examples and comparisons among the methods he so thoroughly explains |
Beschreibung: | Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Nov 2021) |
Beschreibung: | 1 Online-Ressource (561 pages) 41 line drawings 74 tables |
ISBN: | 9780691223384 |
DOI: | 10.1515/9780691223384 |
Internformat
MARC
LEADER | 00000nmm a2200000zc 4500 | ||
---|---|---|---|
001 | BV047641300 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 211215s2021 |||| o||u| ||||||eng d | ||
020 | |a 9780691223384 |9 978-0-691-22338-4 | ||
024 | 7 | |a 10.1515/9780691223384 |2 doi | |
035 | |a (ZDB-23-DGG)9780691223384 | ||
035 | |a (OCoLC)1289768281 | ||
035 | |a (DE-599)BVBBV047641300 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-1043 |a DE-1046 |a DE-858 |a DE-Aug4 |a DE-859 |a DE-860 |a DE-739 | ||
082 | 0 | |a 519.2/33 |2 22 | |
100 | 1 | |a Stewart, William J. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Introduction to the Numerical Solution of Markov Chains |c William J. Stewart |
264 | 1 | |a Princeton, NJ |b Princeton University Press |c [2021] | |
264 | 4 | |c © 1995 | |
300 | |a 1 Online-Ressource (561 pages) |b 41 line drawings 74 tables | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
500 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Nov 2021) | ||
520 | |a A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however, it is necessary to understand how Markov chains can be solved numerically. In this book, the first to offer a systematic and detailed treatment of the numerical solution of Markov chains, William Stewart provides scientists on many levels with the power to put this theory to use in the actual world, where it has applications in areas as diverse as engineering, economics, and education. His efforts make for essential reading in a rapidly growing field. Here Stewart explores all aspects of numerically computing solutions of Markov chains, especially when the state is huge. He provides extensive background to both discrete-time and continuous-time Markov chains and examines many different numerical computing methods--direct, single-and multi-vector iterative, and projection methods. More specifically, he considers recursive methods often used when the structure of the Markov chain is upper Hessenberg, iterative aggregation/disaggregation methods that are particularly appropriate when it is NCD (nearly completely decomposable), and reduced schemes for cases in which the chain is periodic. There are chapters on methods for computing transient solutions, on stochastic automata networks, and, finally, on currently available software. Throughout Stewart draws on numerous examples and comparisons among the methods he so thoroughly explains | ||
546 | |a In English | ||
650 | 7 | |a MATHEMATICS / Probability & Statistics / Stochastic Processes |2 bisacsh | |
650 | 4 | |a Markov processes |x Numerical solutions | |
856 | 4 | 0 | |u https://doi.org/10.1515/9780691223384 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-23-DGG | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-033025502 | ||
966 | e | |u https://doi.org/10.1515/9780691223384 |l FAW01 |p ZDB-23-DGG |q FAW_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l FAB01 |p ZDB-23-DGG |q FAB_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l FCO01 |p ZDB-23-DGG |q FCO_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l FHA01 |p ZDB-23-DGG |q FHA_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l FKE01 |p ZDB-23-DGG |q FKE_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l FLA01 |p ZDB-23-DGG |q FLA_PDA_DGG |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1515/9780691223384 |l UPA01 |p ZDB-23-DGG |q UPA_PDA_DGG |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804183096179818496 |
---|---|
adam_txt | |
any_adam_object | |
any_adam_object_boolean | |
author | Stewart, William J. |
author_facet | Stewart, William J. |
author_role | aut |
author_sort | Stewart, William J. |
author_variant | w j s wj wjs |
building | Verbundindex |
bvnumber | BV047641300 |
collection | ZDB-23-DGG |
ctrlnum | (ZDB-23-DGG)9780691223384 (OCoLC)1289768281 (DE-599)BVBBV047641300 |
dewey-full | 519.2/33 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 519 - Probabilities and applied mathematics |
dewey-raw | 519.2/33 |
dewey-search | 519.2/33 |
dewey-sort | 3519.2 233 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
discipline_str_mv | Mathematik |
doi_str_mv | 10.1515/9780691223384 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03815nmm a2200469zc 4500</leader><controlfield tag="001">BV047641300</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">211215s2021 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780691223384</subfield><subfield code="9">978-0-691-22338-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9780691223384</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-23-DGG)9780691223384</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1289768281</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047641300</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1043</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-858</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.2/33</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Stewart, William J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Introduction to the Numerical Solution of Markov Chains</subfield><subfield code="c">William J. Stewart</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ</subfield><subfield code="b">Princeton University Press</subfield><subfield code="c">[2021]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (561 pages)</subfield><subfield code="b">41 line drawings 74 tables</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Nov 2021)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however, it is necessary to understand how Markov chains can be solved numerically. In this book, the first to offer a systematic and detailed treatment of the numerical solution of Markov chains, William Stewart provides scientists on many levels with the power to put this theory to use in the actual world, where it has applications in areas as diverse as engineering, economics, and education. His efforts make for essential reading in a rapidly growing field. Here Stewart explores all aspects of numerically computing solutions of Markov chains, especially when the state is huge. He provides extensive background to both discrete-time and continuous-time Markov chains and examines many different numerical computing methods--direct, single-and multi-vector iterative, and projection methods. More specifically, he considers recursive methods often used when the structure of the Markov chain is upper Hessenberg, iterative aggregation/disaggregation methods that are particularly appropriate when it is NCD (nearly completely decomposable), and reduced schemes for cases in which the chain is periodic. There are chapters on methods for computing transient solutions, on stochastic automata networks, and, finally, on currently available software. Throughout Stewart draws on numerous examples and comparisons among the methods he so thoroughly explains</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Probability & Statistics / Stochastic Processes</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Markov processes</subfield><subfield code="x">Numerical solutions</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033025502</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAW_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FAB01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FAB_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FCO01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FCO_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FHA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FKE_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">FLA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1515/9780691223384</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-23-DGG</subfield><subfield code="q">UPA_PDA_DGG</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV047641300 |
illustrated | Not Illustrated |
index_date | 2024-07-03T18:47:53Z |
indexdate | 2024-07-10T09:18:00Z |
institution | BVB |
isbn | 9780691223384 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-033025502 |
oclc_num | 1289768281 |
open_access_boolean | |
owner | DE-1043 DE-1046 DE-858 DE-Aug4 DE-859 DE-860 DE-739 |
owner_facet | DE-1043 DE-1046 DE-858 DE-Aug4 DE-859 DE-860 DE-739 |
physical | 1 Online-Ressource (561 pages) 41 line drawings 74 tables |
psigel | ZDB-23-DGG ZDB-23-DGG FAW_PDA_DGG ZDB-23-DGG FAB_PDA_DGG ZDB-23-DGG FCO_PDA_DGG ZDB-23-DGG FHA_PDA_DGG ZDB-23-DGG FKE_PDA_DGG ZDB-23-DGG FLA_PDA_DGG ZDB-23-DGG UPA_PDA_DGG |
publishDate | 2021 |
publishDateSearch | 2021 |
publishDateSort | 2021 |
publisher | Princeton University Press |
record_format | marc |
spelling | Stewart, William J. Verfasser aut Introduction to the Numerical Solution of Markov Chains William J. Stewart Princeton, NJ Princeton University Press [2021] © 1995 1 Online-Ressource (561 pages) 41 line drawings 74 tables txt rdacontent c rdamedia cr rdacarrier Description based on online resource; title from PDF title page (publisher's Web site, viewed 29. Nov 2021) A cornerstone of applied probability, Markov chains can be used to help model how plants grow, chemicals react, and atoms diffuse--and applications are increasingly being found in such areas as engineering, computer science, economics, and education. To apply the techniques to real problems, however, it is necessary to understand how Markov chains can be solved numerically. In this book, the first to offer a systematic and detailed treatment of the numerical solution of Markov chains, William Stewart provides scientists on many levels with the power to put this theory to use in the actual world, where it has applications in areas as diverse as engineering, economics, and education. His efforts make for essential reading in a rapidly growing field. Here Stewart explores all aspects of numerically computing solutions of Markov chains, especially when the state is huge. He provides extensive background to both discrete-time and continuous-time Markov chains and examines many different numerical computing methods--direct, single-and multi-vector iterative, and projection methods. More specifically, he considers recursive methods often used when the structure of the Markov chain is upper Hessenberg, iterative aggregation/disaggregation methods that are particularly appropriate when it is NCD (nearly completely decomposable), and reduced schemes for cases in which the chain is periodic. There are chapters on methods for computing transient solutions, on stochastic automata networks, and, finally, on currently available software. Throughout Stewart draws on numerous examples and comparisons among the methods he so thoroughly explains In English MATHEMATICS / Probability & Statistics / Stochastic Processes bisacsh Markov processes Numerical solutions https://doi.org/10.1515/9780691223384 Verlag URL des Erstveröffentlichers Volltext |
spellingShingle | Stewart, William J. Introduction to the Numerical Solution of Markov Chains MATHEMATICS / Probability & Statistics / Stochastic Processes bisacsh Markov processes Numerical solutions |
title | Introduction to the Numerical Solution of Markov Chains |
title_auth | Introduction to the Numerical Solution of Markov Chains |
title_exact_search | Introduction to the Numerical Solution of Markov Chains |
title_exact_search_txtP | Introduction to the Numerical Solution of Markov Chains |
title_full | Introduction to the Numerical Solution of Markov Chains William J. Stewart |
title_fullStr | Introduction to the Numerical Solution of Markov Chains William J. Stewart |
title_full_unstemmed | Introduction to the Numerical Solution of Markov Chains William J. Stewart |
title_short | Introduction to the Numerical Solution of Markov Chains |
title_sort | introduction to the numerical solution of markov chains |
topic | MATHEMATICS / Probability & Statistics / Stochastic Processes bisacsh Markov processes Numerical solutions |
topic_facet | MATHEMATICS / Probability & Statistics / Stochastic Processes Markov processes Numerical solutions |
url | https://doi.org/10.1515/9780691223384 |
work_keys_str_mv | AT stewartwilliamj introductiontothenumericalsolutionofmarkovchains |