- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Anmerkungen
-
Leipzig, Universität Leipzig, Dissertation, 2024
- Schlagwort
-
Schwach besetzte Matrix
Computeralgebra
Polynom
Algebraische Geometrie
Dünnes Gitter
Lineares Gleichungssystem
- Ereignis
-
Veröffentlichung
- (wo)
-
Leipzig
- (wer)
-
Universitätsbibliothek Leipzig
- (wann)
-
2024
- Urheber
-
Rose, Kemal
- URN
-
urn:nbn:de:bsz:15-qucosa2-928697
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:42 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Rose, Kemal
- Universitätsbibliothek Leipzig
Entstanden
- 2024
Ähnliche Objekte (12)
Probabilistically stable numerical sparse polynomial interpolation
Mixed lattice polytope theory with a view towards sparse polynomial systems
Polynomial Chaos Expansion mit räumlich adaptiven Sparse Grids
Monomial patterns in polynomial optimization
Large sparse numerical optimization
Optimal Feedback Law Recovery by Gradient-Augmented Sparse Polynomial Regression
Joint Sparse Recovery Through Manifold Optimization
Advanced Optimization Techniques for Sparse Grids on Modern Heterogeneous Systems
Advanced optimization techniques for sparse grids on modern heterogeneous systems
Sparse Recovery for Orthogonal Polynomial Transforms: Q/A Session B - Paper B3.B
A Block-Sparse Tensor Train Format for Sample-Efficient High-Dimensional Polynomial Regression
Uncertainty Quantification via Polynomial Chaos Expansion – Methods and Applications for Optimization of Power Systems
Probabilistically stable numerical sparse polynomial interpolation
Mixed lattice polytope theory with a view towards sparse polynomial systems
Polynomial Chaos Expansion mit räumlich adaptiven Sparse Grids
Monomial patterns in polynomial optimization
Large sparse numerical optimization
Optimal Feedback Law Recovery by Gradient-Augmented Sparse Polynomial Regression
Joint Sparse Recovery Through Manifold Optimization
Advanced Optimization Techniques for Sparse Grids on Modern Heterogeneous Systems
Advanced optimization techniques for sparse grids on modern heterogeneous systems
Sparse Recovery for Orthogonal Polynomial Transforms: Q/A Session B - Paper B3.B
A Block-Sparse Tensor Train Format for Sample-Efficient High-Dimensional Polynomial Regression
Uncertainty Quantification via Polynomial Chaos Expansion – Methods and Applications for Optimization of Power Systems
Probabilistically stable numerical sparse polynomial interpolation
Mixed lattice polytope theory with a view towards sparse polynomial systems
Polynomial Chaos Expansion mit räumlich adaptiven Sparse Grids
Monomial patterns in polynomial optimization
Large sparse numerical optimization
Optimal Feedback Law Recovery by Gradient-Augmented Sparse Polynomial Regression
Joint Sparse Recovery Through Manifold Optimization
Advanced Optimization Techniques for Sparse Grids on Modern Heterogeneous Systems
Advanced optimization techniques for sparse grids on modern heterogeneous systems
Sparse Recovery for Orthogonal Polynomial Transforms: Q/A Session B - Paper B3.B
A Block-Sparse Tensor Train Format for Sample-Efficient High-Dimensional Polynomial Regression