Pages that link to "Item:Q2713568"
From MaRDI portal
The following pages link to Computing the nearest diagonally dominant matrix (Q2713568):
Displaying 6 items.
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix (Q1412439) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones (Q2570742) (← links)
- Diagonally Dominant Principal Component Analysis (Q5066006) (← links)
- Primal and polar approach for computing the symmetric diagonally dominant projection (Q5317849) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)