Výsledky vyhledávání - Numerical Algorithms and Problems—computations on matrices*

Parallel Block Tridiagonalization of Real Symmetric Matrices

Autoři: Yihua Bai Robert C. Ward The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Yihua Bai Robert C. Ward The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.utk.edu/~library/TechReports/2006/ut-cs-06-578.pdf.

Témata: analysis, Parallel and vector implementations, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on matrices General Terms, Algorithms, Performance Additional Key Words and Phrases, Block-tridiagonal matrix, approximate eigenvalues, block divide-andconquer, orthogonal block reduction

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.671

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.671
http://www.cs.utk.edu/~library/TechReports/2006/ut-cs-06-578.pdf

Fortran 77 subroutines for computing the eigenvalues of Hamiltonian matrices II. In preparation. See also http://www.math. tu-berlin.de/~kressner/hapack

Autoři: Peter Benner Technische Universität Chemnitz Daniel Kressner a další

Přispěvatelé: Peter Benner Technische Universität Chemnitz Daniel Kressner a další

Zdroj: http://www.math.tu-berlin.de/~kressner/pub/bk2.pdf.

Témata: Categories and Subject Descriptors, D.3.2 [Programming Languages, Language Classifications—Fortran 77, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices, G.1.3 [Numerical Analysis, Numerical Linear Algebra—Eigenvalues and eigenvectors (direct and iterative methods, G.4 [Mathematics of Computing, Mathematical Software—Algorithm design and analysis, Certification and testing, Documentation, Efficiency, Reliability and robustness General Terms, Algorithms, Performance Additional Key Words and Phrases, Algebraic Riccati equation, eigenvalues, Hamiltonian matrix, invariant subspaces, skew-Hamiltonian matrix, symplectic QR decomposition

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3921

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3921
http://www.math.tu-berlin.de/~kressner/pub/bk2.pdf

QR Factorization with Morton-Ordered Quadtree Matrices for Memory Re-use and Parallelism

Autoři: Jeremy D. Frens David S. Wise The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Jeremy D. Frens David S. Wise The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.indiana.edu/~dswise/ppopp03.pdf.

Témata: G.1.3 [Numerical Analysis, Numerical Linear Algebra— linear systems, E.1 [Data Structures, Arrays, D.4.2 [Operating Systems, Storage Management—segmentation, swapping, virtual memory, B.3.2 [Memory Structures, Design Styles—primary memory, D.1.1 [Programming Techniques, Applicative (Functional) Programming, D.1.3 [Programming Techniques, Concurrent Programming—Parallel programming, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—computations on matrices, G.4 [Mathematical Software, Algorithm analysis

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6699; http://www.cs.indiana.edu/~dswise/ppopp03.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6699
http://www.cs.indiana.edu/~dswise/ppopp03.pdf

LIPIcs, Volume 60, APPROX/RANDOM'16, Complete Volume

Autoři: Jansen, Klaus Mathieu, Claire Rolim, José D. P. a další

Přispěvatelé: Jansen, Klaus Mathieu, Claire Rolim, José D. P. a další

Témata: Theory of Computation, Models of Computation, Modes of Computation – Online Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – Computations on Matrices, Nonnumerical Algorithms and Problems

Popis souboru: application/pdf

Relation: Is Part Of LIPIcs, Volume 60, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)

Dostupnost: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2016
https://nbn-resolving.org/urn:nbn:de:0030-drops-66809
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2016

Algorithm XXX: Fortran Subroutines for Computing the Eigenvalues and Eigenvectors of a General Matrix by Reduction to General Tridiagonal Form

Autoři: J.J. Dongarra G. A. Geist C. H. Romine a další

Přispěvatelé: J.J. Dongarra G. A. Geist C. H. Romine a další

Zdroj: http://phase.etl.go.jp/netlib/tennessee/ornl-tm-11669.ps.

Témata: Complexity, Numerical Algorithms and Problems--- computations on matrices, G.1.3 Numerical Analysis, Numerical Linear Algebra--- eigenvalue problems, G.4 Mathematical Software--- algorithm analysis General Terms. Algorithms, eigenvalues, nonsymmetric Additional Key Words and Phrases. Condensed form, numerical algorithms

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8677

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.44.8677
http://phase.etl.go.jp/netlib/tennessee/ornl-tm-11669.ps

Computation of Optimal Backward Perturbation Bounds for Large Sparse Linear Least Squares Problems: Computation of optimal backward perturbation bounds for large sparse linear least squares problems

Autoři: Miloud Sadkane Alexander Malyshev

Zdroj: BIT Numerical Mathematics. 41:739-747

Témata: Computational methods for sparse matrices, numerical examples, Numerical solutions to overdetermined systems, pseudoinverses, algorithm, sparse matrices, Lanczos bidiagonalization, large sparse linear least squares problems, 0101 mathematics, backward perturbation bound, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/1731136
https://doi.org/10.1023/a:1021952203842
https://link.springer.com/article/10.1023/A:1021952203842

A Subdivision-Based Algorithm for the Sparse Resultant

Autoři: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: John F. Canny Ioannis Z. Emiris The Pennsylvania State University CiteSeerX Archives

Zdroj: ftp://ftp-sop.inria.fr/saga/emiris/publis/CEjacm.ps.gz

Témata: Categories and Subject Descriptors, I.1.2 Algorithms (Algebraic algorithms, Analysis of algorithms). F.2.1 Numerical Algorithms and Problems (Computations on matrices, Computations on polynomials). F.2.2 Nonnumerical Algorithms and Problems (Computations on discrete s, Geometrical problems and computations) General Terms, Algorithms, Theory. Additional Key Words and Phrases, Sparse elimination theory, multivariate resultant, Newton polytope, mixed volume, polyhedral subdivision, eoeective Nullstellensatz, asymptotic complexity

Popis souboru: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.4733

Division-free computation of subresultants using Bezout matrices.

Autoři: Kerber, Michael¹ (AUTHOR) mkerber@mpi-inf.mpg.de

Zdroj: International Journal of Computer Mathematics. Dec2009, Vol. 86 Issue 12, p2186-2200. 15p. 2 Charts.

Témata: *Algorithms, Polynomials, Matrices (Mathematics), Determinants (Mathematics), Diophantine equations

Interpretable nonnegative matrix decompositions

Autoři: Saara Hyvönen Pauli Miettinen Evimaria Terzi a další

Přispěvatelé: Saara Hyvönen Pauli Miettinen Evimaria Terzi a další

Zdroj: http://www.almaden.ibm.com/cs/projects/iis/hdb/Publications/papers/nncur2008.pdf.

Témata: Categories and Subject Descriptors H.2.8 [Database Management, Database Applications— Data Mining, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems— Computations on matrices General Terms Algorithms, Experimentation Keywords Matrix decompositions, column-row decompositions, alternating least squares, local search

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7437; http://www.almaden.ibm.com/cs/projects/iis/hdb/Publications/papers/nncur2008.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.7437
http://www.almaden.ibm.com/cs/projects/iis/hdb/Publications/papers/nncur2008.pdf

Computing the Rank and a Small Nullspace Basis of a Polynomial Matrix

Autoři: Arne Storjohann Gilles Villard The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Arne Storjohann Gilles Villard The Pennsylvania State University CiteSeerX Archives

Zdroj: http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/issac05.pdf.

Témata: Categories and Subject Descriptors, I.1[Symbolic and Algebraic Manipulation, Algorithms, F.2.1[Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices General Terms, Algorithms Keywords, linear algebra, polynomial matrix, matrix rank, nullspace

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.5411

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.5411
http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/issac05.pdf

The Effect of the Back Button in a Random Walk

Autoři: Application For Pagerank The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Application For Pagerank The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.www2004.org/proceedings/docs/2p370.pdf.

Témata: F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices General Terms Algorithms, Measurement Keywords Web analysis, PageRank, Random walk, flow, back button

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3187; http://www.www2004.org/proceedings/docs/2p370.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.2.3187
http://www.www2004.org/proceedings/docs/2p370.pdf

Complexity Results for Some Eigenvector Problems

Autoři: Thomas Eiter Georg Gottlob The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Thomas Eiter Georg Gottlob The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.kr.tuwien.ac.at/staff/eiter/et-archive/ijcm-eigen.pdf.

Témata: mathematical programming, eigenvectors, problem complexity, combinatorial optimization Computing Reviews Categories, F.2.1. [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems – computation on matrices, G.1.6 [Numerical Analysis, Optimization – integer

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.6433

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.6433
http://www.kr.tuwien.ac.at/staff/eiter/et-archive/ijcm-eigen.pdf

Compiler Blockability of Dense Matrix

Autoři: Steve Carr R. B. Lehoucq The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Steve Carr R. B. Lehoucq The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.mtu.edu/%7Ecarr/papers/toms97.pdf.

Témata: Categories and Subject Descriptors, D.3.4 [Programming Languages, Processors—compilers, optimization, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—computations on matrices, G.1.3 [Numerical Analysis, Numerical Linear Algebra—linear systems, G.4 [Mathematics of Computing, Mathematical Soft

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.6325; http://www.cs.mtu.edu/%7Ecarr/papers/toms97.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1.6325
http://www.cs.mtu.edu/%7Ecarr/papers/toms97.pdf

Spectral approximation with matrices issued from discretized operators

Approximation spectrale de matrices issues d'opérateurs discrétisés

Autoři: Silva Nunes, Ana Luisa

Thesis Advisors: Saint-Etienne, Universidade do Porto, Ahues Blanchait, Mario, Beleza de Vasconcelos, Paulo

Témata: Matrices hiérarchiques, Valeurs propres, Discrétisation d'un opérateur intégral, HLIB, SLEPc, Special functions, Computational aspects, Integral Equations, Eigenvalue problems, Complexity and performance of numerical algorithms

Dostupnost: http://www.theses.fr/2012STET4006/document

Compiler Blockability of Dense Matrix Factorizations

Autoři: Carr, Steve Lehoucq, R. B.

Zdroj: Michigan Tech Publications

Témata: D.3.4 [Programming Languages]: Processors - compilers, F.2.1 [Analysis of Algorithms and Problem Complexity]: Numerical Algorithms and Problems - computations on matrices, Optimization

Relation: https://doi.org/10.1145/275323.275325

Dostupnost: https://digitalcommons.mtu.edu/michigantech-p/12557
https://doi.org/10.1145/275323.275325

Communication Avoiding Symmetric Band Reduction

Autoři: Grey Ballard James Demmel Nicholas Knight a další

Přispěvatelé: Grey Ballard James Demmel Nicholas Knight a další

Zdroj: http://www.cs.berkeley.edu/~knight/bdk_PPoPP12.pdf.

Témata: Categories and Subject Descriptors G.1.3 [Numerical Analysis, Numerical Linear Algebra- Eigenvalues and eigenvectors (direct and iterative methods, F.2.1 [Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems- Computations on matrices General Terms Algorithms, Performance, Theory Keywords Symmetric eigenvalue problem, Communication avoiding algorithms, Band

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.7061; http://www.cs.berkeley.edu/~knight/bdk_PPoPP12.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.352.7061
http://www.cs.berkeley.edu/~knight/bdk_PPoPP12.pdf

Computing the rank and a small nullspace basis of a polynomial matrix

Autoři: Arne Storjohann Gilles Villard The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Arne Storjohann Gilles Villard The Pennsylvania State University CiteSeerX Archives

Zdroj: http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/f71-villard.pdf.

Témata: Categories and Subject Descriptors, I.1[Symbolic and Algebraic Manipulation, Algorithms, F.2.1[Analysis of Algorithms and Problem Complexity, Numerical Algorithms and Problems—Computations on matrices General Terms, Algorithms Keywords, linear algebra, polynomial matrix, matrix rank, nullspace

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.477.3342

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.477.3342
http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/f71-villard.pdf

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016)

Přispěvatelé: Jansen, Klaus Mathieu, Claire Rolim, José D. P. a další

Dostupnost: http://data.europeana.eu/aggregation/europeana/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U
http://data.europeana.eu/item/2048441/item_NAMDODOHHLLYF5VQONYTE3SE3XB2J56U

Spectral approximation with matrices issued from discretized operators ; Approximation spectrale de matrices issues d’opérateurs discrétisés

Autoři: Silva Nunes, Ana Luisa Institut Camille Jordan (ICJ) École Centrale de Lyon (ECL) a další

Přispěvatelé: Silva Nunes, Ana Luisa Institut Camille Jordan (ICJ) École Centrale de Lyon (ECL) a další

Zdroj: https://theses.hal.science/tel-00952977 ; General Mathematics [math.GM]. Université Jean Monnet - Saint-Etienne; Universidade do Porto, 2012. English. ⟨NNT : 2012STET4006⟩.

Témata: Special functions, Computational aspects, Integral Equations, Eigenvalue problems, Complexity and performance of numerical algorithms, Matrices hiérarchiques, Valeurs propres, Discrétisation d'un opérateur intégral, HLIB, SLEPc, [MATH.MATH-GM]Mathematics [math]/General Mathematics [math.GM]

Relation: NNT: 2012STET4006

Dostupnost: https://theses.hal.science/tel-00952977
https://theses.hal.science/tel-00952977v1/document
https://theses.hal.science/tel-00952977v1/file/These-SilvaNunes-Ana-2012.pdf

CONSISTENCY OF GENERALIZED FINITE DIFFERENCE SCHEMES FOR THE STOCHASTIC HJB EQUATION.

Autoři: Bonnans, J. Frédéric Zidani, Housnaa

Zdroj: SIAM Journal on Numerical Analysis; 2003, Vol. 41 Issue 3, p1008, 14p

Témata: NUMERICAL analysis, STOCHASTIC systems, MATHEMATICS research