Suchergebnisse - "Linear algebra algorithms"

GeoTS: A TSC framework for estimating geological formation to model carbon storage reservoirs

Autoren: Salimath, Shwetha Bugiotti, Francesca Wlodarczyk, Sylvain et al.

Weitere Verfasser: Salimath, Shwetha Bugiotti, Francesca Wlodarczyk, Sylvain et al.

Quelle: SIGKDD ; https://hal.science/hal-05184905 ; SIGKDD, ACM, Aug 2025, Toronto, Canada. pp.4773-4783, ⟨10.1145/3711896.3737228⟩

Schlagwörter: Deep Learning Time series classification Carbon storage Lithography, Machine Learning, • Applied computing → Environmental sciences Deep Learning, Linear algebra algorithms, Feature selection, Cross-validation, Anomaly detection, Cluster analysis, • Computing methodologies → Supervised learning by classification, Information extraction, Autonomous database administration, Information systems → Data cleaning, CCS Concepts, Reservoirs, CCS Concepts Information systems → Data cleaning Autonomous database administration Information extraction • Computing methodologies → Supervised learning by classification Cluster analysis Anomaly detection Cross-validation Feature selection Linear algebra algorithms • Applied computing → Environmental sciences Deep Learning, Deep Learning, Time series classification, Carbon storage, Lithography, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [SDE]Environmental Sciences

Geographisches Schlagwort: Toronto

Time: Toronto, Canada

Verfügbarkeit: https://hal.science/hal-05184905
https://hal.science/hal-05184905v1/file/KDD%20GeoTS%20framework%20paper%20final_ver.pdf
https://doi.org/10.1145/3711896.3737228

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Autoren: Bellavita, Julian Jacquelin, Mathias Ng, Esmond G et al.

Quelle: ACM International Conference Proceeding Series

Schlagwörter: 46 Information and Computing Sciences (for-2020), 4601 Applied Computing (for-2020), Distributed programming models, Hybrid symbolic-numeric methods, Linear algebra algorithms, Mathematics of computing, Parallel programming models, Sparse Cholesky Solvers, UPC++

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/7fr1n7hf
https://escholarship.org/content/qt7fr1n7hf/qt7fr1n7hf.pdf

Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization

Autoren: Erick R. Castro Eldues O. Martins Roberto S. Sarthour et al.

Quelle: Frontiers in Physics, Vol 12 (2024)

Schlagwörter: Quantum Physics, Physics, QC1-999, linear algebra algorithms, digital annealing, FOS: Physical sciences, quadratic unconstrained binary optimization formulation, Computational Physics (physics.comp-ph), Quantum Physics (quant-ph), Physics - Computational Physics, conjugate geometry approach, convergence analysis

Zugangs-URL: http://arxiv.org/abs/2309.09933
https://doaj.org/article/484ab03c593c4dcbaee4c0f825e516f5

Decoding Simultaneous Rational Evaluation Codes

Autoren: Abbondati, Matteo Guerrini, Eleonora Lebreton, Romain et al.

Weitere Verfasser: Abbondati, Matteo Guerrini, Eleonora Lebreton, Romain et al.

Quelle: ISSAC 2024 - 49th International Symposium on Symbolic and Algebraic Computation ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04628184 ; ISSAC 2024 - 49th International Symposium on Symbolic and Algebraic Computation, Jonathan Hauenstein, Jul 2024, Raleigh (North Carolina), United States. ⟨10.1145/3666000.3669686⟩ ; https://www.issac-conference.org/2024/

Schlagwörter: Simultaneous rational function reconstruction, Fault tolerant algorithm, Reed Solomon codes, Chinese remainder codes, Interleaved codes, Decoding failure probability analysis, Algebraic algorithms, Linear algebra algorithms, Probabilistic algorithms, Coding theory, Simultaneous rational number reconstruction, [INFO]Computer Science [cs]

Geographisches Schlagwort: Raleigh (North Carolina), United States

Verfügbarkeit: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04628184
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04628184v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04628184v1/file/issac24.pdf
https://doi.org/10.1145/3666000.3669686

On fast multiplication of a matrix by its transpose

Autoren: Dumas, Jean-Guillaume Pernet, Clément Sedoglavic, Alexandre et al.

Weitere Verfasser: Dumas, Jean-Guillaume Pernet, Clément Sedoglavic, Alexandre et al.

Quelle: Proceedings of the 45th International Symposium on Symbolic and Algebraic Computation. :162-169

Schlagwörter: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Wishart matrix, [INFO.INFO-SC] Computer Science [cs]/Symbolic Computation [cs.SC], Symmetric matrix, algebraic complexity, fast matrix multiplication, 0102 computer and information sciences, Symbolic Computation (cs.SC), 01 natural sciences, Linear algebra algorithms, SYRK, Gram matrix, 0101 mathematics, rank-k update, Exact arithmetic algorithms

Dateibeschreibung: application/octet-stream; application/pdf

Zugangs-URL: http://arxiv.org/pdf/2001.04109
http://arxiv.org/abs/2001.04109
https://arxiv.org/abs/2001.04109
https://arxiv.org/pdf/2001.04109.pdf
https://hal.archives-ouvertes.fr/hal-02432390/document
https://lilloa.univ-lille.fr/handle/20.500.12210/29493
https://dl.acm.org/doi/pdf/10.1145/3373207.3404021
https://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-04109
http://dblp.uni-trier.de/db/journals/corr/corr2001.html#abs-2001-04109
https://ui.adsabs.harvard.edu/abs/2020arXiv200104109D/abstract
http://hdl.handle.net/20.500.12210/21780
https://hal.science/hal-02432390v4/document
https://hal.science/hal-02432390v4
https://doi.org/10.1145/3373207.3404021

High-Performance Scientific Applications Using Mixed Precision and Low-Rank Approximation Powered by Task-based Runtime Systems

Autoren: Alomairy, Rabab M.

Thesis Advisors: Keyes, David E., Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division, Moshkov, Mikhail, Hadwiger, Markus, Ltaief, Hatem

Schlagwörter: Mixed Precision, Low-Rank Approximation, Task-based Runtime Systems, Scientific Applications, Acoustic Scattering, Mesh Deformation, Genome-Wide Association Study, Dense Linear Algebra Algorithms, Abstraction Layer, LU/Cholesky-based Solver

Verfügbarkeit: http://hdl.handle.net/10754/679787

Using Static Allocation Algorithms for Matrix Matrix Multiplication on Multicores and GPUs

Autoren: Eyraud-Dubois, Lionel Lambert, Thomas

Weitere Verfasser: Eyraud-Dubois, Lionel Lambert, Thomas

Quelle: Proceedings of the 47th International Conference on Parallel Processing. :1-10

Schlagwörter: General and reference → Performance, Parallel algorithms, 13. Climate action, 0103 physical sciences, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0102 computer and information sciences, Mathematics of computing → Solvers, Computing methodologies → Linear algebra algorithms, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.inria.fr/hal-01670678/file/icpp.pdf
https://inria.hal.science/hal-01670678v2/document
https://inria.hal.science/hal-01670678v2
https://doi.org/10.1145/3225058.3225066
https://hal.inria.fr/hal-01670678/document
https://doi.org/10.1145/3225058.3225066
https://hal.archives-ouvertes.fr/hal-01670678
https://dblp.uni-trier.de/db/conf/icpp/icpp2018.html#Eyraud-DuboisL18
https://hal.inria.fr/hal-01670678v2

On the parallel I/O optimality of linear algebra kernels: Near-optimal matrix factorizations

Autoren: Kwasniewski, Grzegorz Kabic, Marko Ben-Nun, Tal et al.

Quelle: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC '21)

Schlagwörter: Distributed linear algebra algorithms, Communication complexity, Matrix factorization

Dateibeschreibung: application/application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-8442-1; info:eu-repo/grantAgreement/EC/H2020/678880; info:eu-repo/grantAgreement/EC/H2020/801039; info:eu-repo/grantAgreement/SNF/Ambizione/185778; http://hdl.handle.net/20.500.11850/518903

Verfügbarkeit: https://hdl.handle.net/20.500.11850/518903
https://doi.org/10.3929/ethz-b-000518903

Black Box Absolute Reconstruction for Sums of Powers of Linear Forms

Autoren: Koiran, Pascal Saha, Subhayan Pascal Koiran and Subhayan Saha

Weitere Verfasser: Koiran, Pascal Saha, Subhayan Pascal Koiran and Subhayan Saha

Schlagwörter: FOS: Computer and information sciences, reconstruction algorithms, black box, simultaneous diagonalisation, sums of powers of linear forms, 0102 computer and information sciences, [INFO] Computer Science [cs], Computational Complexity (cs.CC), Computing methodologies → Linear algebra algorithms, 01 natural sciences, Computer Science - Computational Complexity, tensor decomposition, Computer Science - Data Structures and Algorithms, Computing methodologies → Algebraic algorithms, Data Structures and Algorithms (cs.DS), ddc:004, algebraic algorithm, 0101 mathematics, Theory of computation → Algebraic complexity theory

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2110.05305
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2022.24
https://hal.science/hal-04636862v1
https://doi.org/10.4230/lipics.fsttcs.2022.24

Performance and Energy Analysis of OpenMP Runtime Systems with Dense Linear Algebra Algorithms

Autoren: Ferreira Lima, Joao Vicente Raïs, Issam Lefèvre, Laurent et al.

Weitere Verfasser: Ferreira Lima, Joao Vicente Raïs, Issam Lefèvre, Laurent et al.

Quelle: 2017 International Symposium on Computer Architecture and High Performance Computing Workshops (SBAC-PADW). :7-12

Schlagwörter: NUMA, linear-algebra algorithms, 13. Climate action, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, OpenMP, 02 engineering and technology, task parallelism, 7. Clean energy, energy efficiency

Dateibeschreibung: application/pdf

Zugangs-URL: https://hal.archives-ouvertes.fr/hal-01666343/file/wamca2017.pdf
https://hal.inria.fr/hal-01957220/file/ijhpca-wamca2017.pdf
https://inria.hal.science/hal-01957220v1
https://doi.org/10.1177/1094342018792079
https://inria.hal.science/hal-01957220v1/document
https://journals.sagepub.com/doi/pdf/10.1177/1094342018792079
https://dblp.uni-trier.de/db/journals/ijhpca/ijhpca33.html#LimaRLG19
https://doi.org/10.1177/1094342018792079
https://hal.archives-ouvertes.fr/hal-01666343
http://ieeexplore.ieee.org/document/8108998/
https://hal.inria.fr/hal-01957220
https://doi.org/10.1109/SBAC-PADW.2017.10
https://ieeexplore.ieee.org/document/8108998/
https://hal.inria.fr/hal-01957220/document

Floating-Point Calculations on a Quantum Annealer: Division and Matrix Inversion

Autoren: Michael L. Rogers Robert L. Singleton

Quelle: Frontiers in Physics, Vol 8 (2020)

Schlagwörter: quantum computing, matrix inversion, quantum annealing algorithm, linear algebra algorithms, D-wave, Physics, QC1-999

Dateibeschreibung: electronic resource

Relation: https://www.frontiersin.org/articles/10.3389/fphy.2020.00265/full; https://doaj.org/toc/2296-424X

Zugangs-URL: https://doaj.org/article/274e10d5e6114c51afe4ac2d3cbb87c1

On the parallel I/O optimality of linear algebra kernels: near-optimal LU factorization

Autoren: Kwasniewski, Grzegorz Kabic, Marko Ben-Nun, Tal et al.

Quelle: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC '21)
Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

Schlagwörter: FOS: Computer and information sciences, Computer Science - Performance, Communication complexity, Matrix factorization, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Performance (cs.PF), Computer Science - Computational Complexity, Computer Science - Distributed, Parallel, and Cluster Computing, Distributed linear algebra algorithms, Distributed, Parallel, and Cluster Computing (cs.DC), 0101 mathematics

Dateibeschreibung: application/application/pdf

Zugangs-URL: http://arxiv.org/pdf/2108.09337
http://arxiv.org/abs/2010.05975
http://arxiv.org/abs/2108.09337
https://arxiv.org/abs/2108.09337
https://arxiv.org/pdf/2010.05975v1
http://export.arxiv.org/pdf/2108.09337
http://export.arxiv.org/abs/2108.09337
https://ui.adsabs.harvard.edu/abs/2020arXiv201005975K/abstract
https://dblp.uni-trier.de/db/conf/sc/sc2021.html#KwasniewskiKBZS21
https://arxiv.org/abs/2108.09337
https://dl.acm.org/doi/pdf/10.1145/3437801.3441590
https://arxiv.org/pdf/2108.09337
https://dblp.uni-trier.de/db/conf/ppopp/ppopp2021.html#KwasniewskiBZSB21
http://hdl.handle.net/20.500.11850/518903

A test for FLOPs as a discriminant for linear algebra algorithms

Autoren: Sankaran, Aravind Bientinesi, Paolo

Quelle: 2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD) Proceedings (Symposium on Computer Architecture and High Performance Computing). :221-230

Schlagwörter: Algorithm ranking, Linear algebra algorithms, Mathematical software performance, Performance Analysis

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-203573

Performance and Energy Analysis of OpenMP Runtime Systems with Dense Linear Algebra Algorithms

Autoren: Ferreira Lima, Joao Vicente Raïs, Issam Lefèvre, Laurent et al.

Weitere Verfasser: Ferreira Lima, Joao Vicente Raïs, Issam Lefèvre, Laurent et al.

Quelle: ISSN: 1094-3420 ; International Journal of High Performance Computing Applications ; https://inria.hal.science/hal-01957220 ; International Journal of High Performance Computing Applications, 2019, 33 (3), pp.431-443. ⟨10.1177/1094342018792079⟩.

Schlagwörter: energy efficiency, NUMA, linear-algebra algorithms, task parallelism, OpenMP, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Verfügbarkeit: https://inria.hal.science/hal-01957220
https://inria.hal.science/hal-01957220v1/document
https://inria.hal.science/hal-01957220v1/file/ijhpca-wamca2017.pdf
https://doi.org/10.1177/1094342018792079

GenEO

Autoren: Gouarin, Loïc Spillane, Nicole École polytechnique (X) et al.

Weitere Verfasser: Gouarin, Loïc Spillane, Nicole École polytechnique (X) et al.

Quelle: https://hal.science/hal-04582368 ; 2024, ⟨swh:1:dir:5a15d3ba0451c65ec5298b97ba3b9c2efab2d152.

Schlagwörter: Linear algebra algorithms, Domain decomposition Method, Preconditionner, SPD Matrices, [MATH.MATH-AP]Mathematics [math]/Analysis of PDEs [math.AP]

Verfügbarkeit: https://hal.science/hal-04582368
https://hal.science/hal-04582368v1/document

DataSheet1_Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization.pdf

Autoren: Erick R. Castro Eldues O. Martins Roberto S. Sarthour et al.

Schlagwörter: Biophysics, Astrophysics, Applied Physics, Computational Physics, Condensed Matter Physics, Particle Physics, Plasma Physics, Solar System, Solar Physics, Planets and Exoplanets, Classical and Physical Optics, Photonics, Optoelectronics and Optical Communications, Cloud Physics, Tropospheric and Stratospheric Physics, High Energy Astrophysics, Cosmic Rays, Mesospheric, Ionospheric and Magnetospheric Physics, Space and Solar Physics, Mathematical Physics not elsewhere classified, Physical Chemistry of Materials, Physical Chemistry not elsewhere classified, Classical Physics not elsewhere classified, Condensed Matter Physics not elsewhere classified, Quantum Physics not elsewhere classified, linear algebra algorithms, quadratic unconstrained binary optimization formulation, digital annealing, conjugate geometry approach

Relation: https://figshare.com/articles/dataset/DataSheet1_Improving_the_convergence_of_an_iterative_algorithm_for_solving_arbitrary_linear_equation_systems_using_classical_or_quantum_binary_optimization_pdf/27116476

Verfügbarkeit: https://doi.org/10.3389/fphy.2024.1443977.s001
https://figshare.com/articles/dataset/DataSheet1_Improving_the_convergence_of_an_iterative_algorithm_for_solving_arbitrary_linear_equation_systems_using_classical_or_quantum_binary_optimization_pdf/27116476

Black Box Absolute Reconstruction for Sums of Powers of Linear Forms

Autoren: Koiran, Pascal Saha, Subhayan Modèles de calcul, Complexité, Combinatoire (MC2) et al.

Weitere Verfasser: Koiran, Pascal Saha, Subhayan Modèles de calcul, Complexité, Combinatoire (MC2) et al.

Quelle: FSTTCS 2022 ; https://hal.science/hal-04636862 ; FSTTCS 2022, Dec 2022, Madras, India. ⟨10.4230/LIPIcs.FSTTCS.2022.24⟩

Schlagwörter: reconstruction algorithms, tensor decomposition, sums of powers of linear forms, simultaneous diagonalisation, algebraic algorithm, black box, Theory of computation → Algebraic complexity theory, Computing methodologies → Algebraic algorithms, Computing methodologies → Linear algebra algorithms, [INFO]Computer Science [cs]

Geographisches Schlagwort: India

Time: Madras, India

Verfügbarkeit: https://hal.science/hal-04636862
https://doi.org/10.4230/LIPIcs.FSTTCS.2022.24

Representing linear algebra algorithms in code: the FLAME application program interfaces: Representing linear algebra algorithms in code: The FLAME application program interfaces

Autoren: Robert A. van de Geijn Paolo Bientinesi Enrique S. Quintana-Ortí

Quelle: ACM Transactions on Mathematical Software. 31:27-59

Schlagwörter: formal linear algebra methods environment, linear algebra algorithms, Other matrix algorithms, 0202 electrical engineering, electronic engineering, information engineering, Packaged methods for numerical algorithms, application program interfaces, Parallel numerical computation, 02 engineering and technology, 0101 mathematics, parallel computation, 01 natural sciences, C programming languages

Dateibeschreibung: application/xml

Zugangs-URL: https://www.cs.utexas.edu/users/flame/pubs/fire.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=1145341
http://www.cs.utexas.edu/~pauldj/pubs/fire.pdf
https://dblp.uni-trier.de/db/journals/toms/toms31.html#BientinesiQG05
https://dl.acm.org/doi/abs/10.1145/1055531.1055533
http://hpac.rwth-aachen.de/~pauldj/pubs/FLAME-API.pdf

On the peculiarities of using sparse matrices in problems of mathematical modeling

Autoren: Khimich, O.M. Popov, A.V. Chystiakov, О.V.

Schlagwörter: mathematical modeling, structural strength problems, sparse matrices, linear algebra algorithms, methods of structuring sparse matrices, UDC 004.415.2.045 (076.5)

Verfügbarkeit: https://harvester.nas.gov.ua/Record/pp_isofts_kiev_ua-article-525

Symbiosis between linear algebra and optimization

Autoren: Dianne P. O'Leary

Quelle: Journal of Computational and Applied Mathematics. 123:447-465

Schlagwörter: Computational Mathematics, Numerical solutions to overdetermined systems, pseudoinverses, Numerical mathematical programming methods, Nonlinear programming, Applied Mathematics, nonlinear programming, 0211 other engineering and technologies, unconstrained optimization, numerical linear algebra algorithms, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://ui.adsabs.harvard.edu/abs/2000JCoAM.123..447O/abstract
https://drum.lib.umd.edu/handle/1903/1012
https://drum.lib.umd.edu/bitstream/1903/1012/4/CS-TR-4023.pdf
https://www.sciencedirect.com/science/article/pii/S0377042700004088
https://www.cs.umd.edu/users/oleary/reprints/j54.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=700185