Randomized Algorithms

Maolin Che and Yimin Wei
Additional contact information
Maolin Che: Southwestern University of Finance and Economics, School of Economics Mathematics
Yimin Wei: Fudan University, School of Mathematical Sciences

Chapter Chapter 8 in Theory and Computation of Complex Tensors and its Applications, 2020, pp 215-246 from Springer

Abstract: Abstract Randomized algorithms Randomized algorithm provide a useful tool for scientific computing. Compared with standard deterministic algorithms, Deterministic algorithm randomized algorithms are often faster and robust.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-15-2059-4_8

Ordering information: This item can be ordered from
http://www.springer.com/9789811520594

DOI: 10.1007/978-981-15-2059-4_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().