Comparison of the Computational Cost of a Monte Carlo and Deterministic Algorithm for Computing Bilinear Forms of Matrix Powers

Lecture Notes in Computer Science - Germany
doi 10.1007/11758532_84
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Parallel Algorithm of Monte Carlo Method for Computing Infrared Transmittance in Particle Cloud

2015English

A Schur–Padé Algorithm for Fractional Powers of a Matrix

SIAM Journal on Matrix Analysis and Applications
Analysis
2011English

Quantum Monte Carlo Endstation for Petascale Computing

2011English

Quantum Monte Carlo Endstation for Petascale Computing

2011English

A Continuation Multilevel Monte Carlo Algorithm

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
2014English

A Fast Algorithm for Computing Binomial Coefficients Modulo Powers of Two

The Scientific World Journal
BiochemistryMedicineGeneticsMolecular BiologyEnvironmental Science
2013English

Computational Analysis and Monte Carlo Simulation of Wave Propagation

International Journal of Computational Biology and Drug Design
Drug DiscoveryComputer Science Applications
2015English

Modern Monte Carlo Methods and GPU Computing

Mathematics in Industry
2017English

The Rational Hybrid Monte Carlo Algorithm

2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy