1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
//! Matrix nearness problems and perturbation theory.
//!
//! This module collects algorithms for finding the closest matrix of a given
//! structure and for quantifying how matrix properties (eigenvalues, invariant
//! subspaces, linear-system solutions) change under perturbation.
//!
//! ## Sub-modules
//!
//! | Sub-module | Description |
//! |---|---|
//! | [`nearest`] | Nearest matrix problems (SPD, orthogonal, correlation, …) |
//! | [`perturbation`] | Classical perturbation bounds (Weyl, Davis-Kahan, Bauer-Fike, …) |
//! | [`pseudospectrum`] | ε-pseudospectrum, Kreiss constant, pseudospectral abscissa |
//!
//! ## Quick reference
//!
//! ### Nearest structured matrices
//!
//! ```rust,ignore
//! use scirs2_linalg::nearness::nearest::{
//! nearest_positive_definite,
//! nearest_orthogonal,
//! nearest_symmetric,
//! nearest_correlation,
//! nearest_doubly_stochastic,
//! nearest_low_rank,
//! };
//! ```
//!
//! ### Perturbation theory
//!
//! ```rust,ignore
//! use scirs2_linalg::nearness::perturbation::{
//! weyl_bounds,
//! davis_kahan_bound,
//! bauer_fike_bound,
//! relative_perturbation_bound,
//! condition_number_sensitivity,
//! };
//! ```
//!
//! ### Pseudospectrum
//!
//! ```rust,ignore
//! use scirs2_linalg::nearness::pseudospectrum::{
//! epsilon_pseudospectrum,
//! kreiss_constant,
//! pseudospectral_abscissa,
//! transient_bound,
//! };
//! ```
//!
//! ## References
//!
//! - Higham, N. J. (1988). Linear Algebra Appl. 103: 103–118.
//! - Higham, N. J. (2002). IMA J. Numer. Anal. 22(3): 329–343.
//! - Davis, C.; Kahan, W. M. (1970). SIAM J. Numer. Anal. 7(1): 1–46.
//! - Weyl, H. (1912). Math. Ann. 71: 441–479.
//! - Trefethen, L. N.; Embree, M. (2005). *Spectra and Pseudospectra*.
//! Princeton University Press.
// ---------------------------------------------------------------------------
// Convenient flat re-exports
// ---------------------------------------------------------------------------
pub use ;
pub use ;
pub use ;