Výsledky vyhledávání - analysis of algorithms). f.2.1 numerical algorithms AND problems (computations on matrices

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

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

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

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

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

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

Separation of Variables and the Computation of Fourier Transforms on Finite Groups, II: Separation of variables and the computation of Fourier transforms on finite groups. I

Autoři: Daniel N. Rockmore David K. Maslen Sciencesconf.org, CCSD a další

Přispěvatelé: Daniel N. Rockmore David K. Maslen Sciencesconf.org, CCSD a další

Zdroj: Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings, 28th... (2020)

Témata: Ordinary representations and characters, Analysis of algorithms and problem complexity, symmetric groups, Group Theory (math.GR), Symbolic computation and algebraic computation, 01 natural sciences, 43-04, 20Cxx, 20-04, 16-04, 16Gxx, 65Txx, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], QA1-939, FOS: Mathematics, Mathematics - Numerical Analysis, Representation Theory (math.RT), 0101 mathematics, separation of variables algorithms, Numerical methods for discrete and fast Fourier transforms, Mathematics - Rings and Algebras, Numerical Analysis (math.NA), [math.math-co]mathematics [math]/combinatorics [math.co], finite groups, matrix products, efficient computations, Weyl groups, [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], fast Fourier transforms, Landbouwwetenschappen, Wiskunde: algemeen, Combinatorics, Rings and Algebras (math.RA), Natuurwetenschappen, combinatorics, Chevalley groups, F.2.1, complexity, Mathematics - Group Theory, Mathematics, Mathematics - Representation Theory, Computational methods (representations of groups), factorizations of group elements

Popis souboru: application/pdf; application/xml; text/plain

Přístupová URL adresa: https://dmtcs.episciences.org/6372/pdf
http://arxiv.org/pdf/1512.02445
https://www.ams.org/jams/1997-10-01/S0894-0347-97-00219-1/S0894-0347-97-00219-1.pdf
http://arxiv.org/abs/1512.02445
https://dmtcs.episciences.org/6372
https://doi.org/10.46298/dmtcs.6372
https://hal.science/hal-02166353v1
https://hal.science/hal-02166353v1/document
https://doi.org/10.46298/dmtcs.6372
https://zbmath.org/963188
https://doi.org/10.1090/s0894-0347-97-00219-1
https://doaj.org/article/e1f4b36ada9648518c8bf043c084494f
https://research-portal.uu.nl/en/publications/297de5a2-ae20-46b8-b86a-1e9907059db0
https://link.springer.com/article/10.1007/s00041-016-9516-4
https://math.dartmouth.edu/graduate-students/works/2013-14/Wolff-GradPosterSession.pdf
https://dspace.library.uu.nl/bitstream/handle/1874/13451/maslen_97_seperation.pdf;sequence=2
https://link.springer.com/article/10.1007/s00041-016-9516-4/fulltext.html
https://www.ams.org/journals/jams/1997-10-01/S0894-0347-97-00219-1/home.html
https://www.ams.org/jams/1997-10-01/S0894-0347-97-00219-1/S0894-0347-97-00219-1.pdf
https://dspace.library.uu.nl/handle/1874/13451
https://dspace.library.uu.nl/bitstream/1874/13451/2/maslen_97_seperation.pdf
https://www.narcis.nl/publication/RecordID/oai%3Adspace.library.uu.nl%3A1874%2F13451
https://dspace.library.uu.nl/handle/1874/13451

The Polar Express: Optimal Matrix Sign Methods and Their Application to the Muon Algorithm

Autoři: Amsel, Noah Persson, David Musco, Christopher a další

Témata: FOS: Computer and information sciences, Numerical Analysis, Numerical Analysis (math.NA), Machine Learning (cs.LG), 65F30, 68T07, 68N19, Machine Learning, Artificial Intelligence (cs.AI), Artificial Intelligence, Optimization and Control (math.OC), Optimization and Control, FOS: Mathematics, Computation and Language, G.1.3, I.2.6, F.2.1, G.1.6, Computation and Language (cs.CL)

Přístupová URL adresa: http://arxiv.org/abs/2505.16932

The GPGCD Algorithm with the Bézout Matrix for Multiple Univariate Polynomials

Autoři: Chi, Boming Terui, Akira

Témata: Computer Science - Symbolic Computation, FOS: Computer and information sciences, G.1.6, FOS: Mathematics, Mathematics - Numerical Analysis, F.2.1, Numerical Analysis (math.NA), Symbolic Computation (cs.SC), Mathematics - Commutative Algebra, Commutative Algebra (math.AC), I.1.2, 13P99, 68W30

Přístupová URL adresa: http://arxiv.org/abs/2205.02984

A stable, polynomial-time algorithm for the eigenpair problem

Autoři: Armentano, Diego Beltrán, Carlos Bürgisser, Peter a další

Zdroj: Journal of the European Mathematical Society. 20:1375-1437

Témata: 65F15, 65F22, G.1.5, Eigenvalue computations, homotopy methods, FOS: Mathematics, 510 Mathematik, Mathematics - Numerical Analysis, F.2.1, Numerical Analysis (math.NA), ddc:510, 0101 mathematics, 01 natural sciences

Popis souboru: application/pdf

Přístupová URL adresa: https://depositonce.tu-berlin.de/bitstream/11303/9050/2/armentano_etal_2018.pdf
http://arxiv.org/abs/1505.03290
https://www.ems-ph.org/journals/show_pdf.php?issn=1435-9855&vol=20&iss=6&rank=2
https://depositonce.tu-berlin.de/handle/11303/9050
https://depositonce.tu-berlin.de/bitstream/11303/9050/2/armentano_etal_2018.pdf
http://ui.adsabs.harvard.edu/abs/2014arXiv1410.0116B/abstract
https://depositonce.tu-berlin.de//handle/11303/9050

I/O Efficient Algorithms for Matrix Computations

Autoři: Mohanty, Sraban Kumar

Témata: FOS: Computer and information sciences, 0102 computer and information sciences, Numerical Analysis (math.NA), F.2.1, G.1.0, I.1.2, 01 natural sciences, 15A23, 11Y16, 65Y20, 68Q25, 68W40, 68W05, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, 0101 mathematics

Přístupová URL adresa: http://arxiv.org/abs/1006.1307

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

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

Communication-optimal parallel algorithm for strassen's matrix multiplication

Autoři: Grey Ballard James Demmel Oded Schwartz a další

Zdroj: Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures. :193-204

Témata: FOS: Computer and information sciences, Numerical Analysis (math.NA), 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Mathematics - Numerical Analysis, Distributed, Parallel, and Cluster Computing (cs.DC), Combinatorics (math.CO), F.2.1, 68W40, 68W10

Přístupová URL adresa: http://arxiv.org/pdf/1202.3173
http://arxiv.org/abs/1202.3173
http://www.cs.berkeley.edu/~odedsc/papers/SPAA12-CAPS.pdf
https://www.cs.huji.ac.il/~odedsc/papers/SPAA12-CAPS.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1202.html#abs-1202-3173
http://www.cs.huji.ac.il/~odedsc/papers/SPAA12-CAPS.pdf
http://www.sandia.gov/~gmballa/talks/Simons13.pdf
https://dl.acm.org/citation.cfm?id=2312044

Parameter Optimization for Restarted Mixed Precision Iterative Sparse Solver

Autoři: Prolubnikov, Alexander V.

Zdroj: Lecture Notes in Computer Science ISBN: 9783031970764

Témata: FOS: Mathematics, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), F.2.1, 15-04

Přístupová URL adresa: http://arxiv.org/abs/2412.08059

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

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

Alternating cyclic extrapolation methods for optimization algorithms

Autoři: Lepage-Saucier, Nicolas

Témata: Optimization and Control (math.OC), FOS: Mathematics, 65K05, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), F.2.1, 0101 mathematics, Mathematics - Optimization and Control, 01 natural sciences

Přístupová URL adresa: http://arxiv.org/abs/2104.04974

Faster inversion and other black box matrix computations using efficient block projections

Autoři: Gilles Villard Pascal Giorgi Wayne Eberly a další

Zdroj: Proceedings of the 2007 international symposium on Symbolic and algebraic computation. :143-150

Témata: Computer Science - Symbolic Computation, G.4, FOS: Computer and information sciences, G.1.3, Numerical Analysis (math.NA), 0102 computer and information sciences, Symbolic Computation (cs.SC), 01 natural sciences, I.1.2, FOS: Mathematics, Mathematics - Numerical Analysis, F.2.1, 0101 mathematics

Přístupová URL adresa: https://hal.archives-ouvertes.fr/hal-00127807/file/eggsv07.pdf
http://arxiv.org/abs/cs/0701188
https://dl.acm.org/doi/10.1145/1277548.1277569
https://hal.archives-ouvertes.fr/hal-00127807/document
http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/issac07sys.pdf
https://dblp.uni-trier.de/db/journals/corr/corr0701.html#abs-cs-0701188
https://ui.adsabs.harvard.edu/abs/2007cs........1188E/abstract
http://www.cecm.sfu.ca/~mmonagan/MITACS/papers/Eberly07.pdf

An inexact infeasible arc-search interior-point method for linear programming problems

Autoři: Iida, Einosuke Yamashita, Makoto

Témata: Mathematics - Optimization and Control, Mathematics - Numerical Analysis, 90C51, 65K05, 90C05, F.2.1, G.1.6, text

URL: http://arxiv.org/abs/2403.18155