Towards a Divide and Conquer Algorithm for the Real Nonsymmetric Eigenvalue Problem

SIAM Journal on Matrix Analysis and Applications - United States
doi 10.1137/s089547989122017x
Full Text
Abstract

Available in full text

Categories
Analysis
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

A Case Against a Divide and Conquer Approach to the Nonsymmetric Eigenvalue Problem

Applied Numerical Mathematics
Computational MathematicsApplied MathematicsNumerical Analysis
1993English

Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem

SIAM Journal of Scientific Computing
Computational MathematicsApplied Mathematics
2012English

An Optimized Divide-And-Conquer Algorithm for the Closest-Pair Problem in the Planar Case

Journal of Computer Science and Technology
HardwareComputer Science ApplicationsArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2012English

Kart: A Divide-And-Conquer Algorithm for NGS Read Alignment

Bioinformatics
StatisticsProbabilityMolecular BiologyBiochemistryComputational TheoryComputer Science ApplicationsMathematicsComputational Mathematics
2017English

A Divide-And-Conquer Method for the Takagi Factorization

SIAM Journal on Matrix Analysis and Applications
Analysis
2008English

Divide-And-Conquer Algorithms for Multiprocessors

English

Divide and Conquer

1993English

Divide and Conquer

2018English

A FEAST Algorithm for the Linear Response Eigenvalue Problem

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy