Suchergebnisse - "factorization algorithms"

Another Approach to Factoring by Continued Fractions

Autoren: Turgut Hanoymak Cihan Kayak

Quelle: Volume: 17, Issue: 133-46
Turkish Journal of Mathematics and Computer Science

Schlagwörter: Factorization algorithms, continued fractions, RSA algorithm, cryptography, Cryptography, Kriptografi

Dateibeschreibung: application/pdf

Zugangs-URL: https://dergipark.org.tr/tr/pub/tjmcs/issue/92235/1569163

Symbolic Computation Applied to the Study of the Kernel of Special Classes of Paired Singular Integral Operators

Autoren: Conceição, Ana C. Sapientia

Weitere Verfasser: Conceição, Ana C. Sapientia

Quelle: Mathematics in Computer Science. 15:63-90

Schlagwörter: Symbolic computation, Sistema de álgebra computacional, Kernel of paired singular integral operators, Factorization algorithms, Essentially bounded matrix functions, 0101 mathematics, Wolfram Mathematica, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://sapientia.ualg.pt/bitstream/10400.1/14645/1/Conceicao_MCS_2020_revised.pdf
https://dblp.uni-trier.de/db/journals/mics/mics15.html#Conceicao21
https://link.springer.com/article/10.1007/s11786-020-00463-3
https://hdl.handle.net/10400.1/14645

Batched matrix computations on hardware accelerators based on GPUs

Weitere Verfasser: Dongarra, Jack [Univ. of Tennessee, Knoxville, TN (United States); Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Univ. of Manchester (United Kingdom)]

Quelle: International Journal of High Performance Computing Applications; 29; 2

Dateibeschreibung: Medium: ED; Size: p. 193-208

Zugangs-URL: http://www.osti.gov/scitech/servlets/purl/1361289

Optimizing the SVD Bidiagonalization Process for a Batch of Small Matrices

Autoren: Jack Dongarra Tingxing Dong Stanimire Tomov et al.

Quelle: Dong, T, Haidar, A, Tomov, S & Dongarra, J 2017, Optimizing the SVD Bidiagonalization Process for a Batch of Small Matrices. in Procedia Computer Science. vol. 108, pp. 1008-1018. https://doi.org/10.1016/j.procs.2017.05.237

Schlagwörter: two-sided factorization algorithms, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Hardware accelerators, 0101 mathematics, batched, Singular Value Problems, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://research.manchester.ac.uk/en/publications/d652df67-1aa0-4b67-b45c-8b7f9db562d6
https://doi.org/10.1016/j.procs.2017.05.237
https://www.sciencedirect.com/science/article/pii/S1877050917308645
https://www.icl.utk.edu/publications/optimizing-svd-bidiagonalization-process-batch-small-matrices
https://www.icl.utk.edu/files/publications/2017/icl-utk-953-2017.pdf
https://www.research.manchester.ac.uk/portal/files/57088796/optimizing_the_svd.pdf
https://core.ac.uk/display/83923148
https://www.sciencedirect.com/science/article/abs/pii/S1877050917308645
https://research.manchester.ac.uk/en/publications/d652df67-1aa0-4b67-b45c-8b7f9db562d6
https://pure.manchester.ac.uk/ws/files/57088796/optimizing_the_svd.pdf
https://doi.org/10.1016/j.procs.2017.05.237

Accelerating the SVD bi-diagonalization of a batch of small matrices using GPUs

Autoren: Tingxing Dong Azzam Haidar Jack Dongarra et al.

Quelle: Dong, T, Haidar, A, Tomov, S & Dongarra, J 2018, 'Accelerating the SVD Bidiagonalization of a Batch of Small Matrices using GPUs', Journal of Computational Science, vol. 26, pp. 237-245. https://doi.org/10.1016/j.jocs.2018.01.007

Schlagwörter: Batched, Numerical linear algebra, 0202 electrical engineering, electronic engineering, information engineering, Two-sided factorization algorithms, 02 engineering and technology, Hardware accelerators, Eigenvalue and singular value problems

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.research.manchester.ac.uk/portal/files/65822562/1_s2.0_S187775031731150X_main.pdf
https://www.research.manchester.ac.uk/portal/files/65822562/1_s2.0_S187775031731150X_main.pdf
https://www.sciencedirect.com/science/article/pii/S187775031731150X#!
https://www.research.manchester.ac.uk/portal/en/publications/accelerating-the-svd-bidiagonalization-of-a-batch-of-small-matrices-using-gpus(52d77474-7ce1-47eb-9ae2-c010a09f2355).html
https://www.sciencedirect.com/science/article/pii/S187775031731150X
https://doi.org/10.1016/j.jocs.2018.01.007
https://www.icl.utk.edu/publications/accelerating-svd-bi-diagonalization-batch-small-matrices-using-gpus

RETRACTED: Batched matrix computations on hardware accelerators based on GPUs

Autoren: Haidar, Azzam Dong, Tingxing Luszczek, Piotr et al.

Quelle: Haidar, A, Dong, T, Luszczek, P, Tomov, S & Dongarra, J 2015, 'Batched matrix computations on hardware accelerators based on GPUs', International Journal of High Performance Computing Applications, vol. 29, no. 2, pp. 193-208. https://doi.org/10.1177/1094342014567546

Schlagwörter: one-sided factorization algorithms, numerical linear algebra, 0202 electrical engineering, electronic engineering, information engineering, Batched factorization, 02 engineering and technology, numerical software libraries, hardware accelerators, 7. Clean energy

Zugangs-URL: https://www.osti.gov/biblio/1361289
https://research.manchester.ac.uk/en/publications/3b928883-2575-424b-9c5c-93c76c117dd7
https://doi.org/10.1177/1094342014567546
https://research.manchester.ac.uk/en/publications/3b928883-2575-424b-9c5c-93c76c117dd7
https://doi.org/10.1177/1094342014567546
http://www.scopus.com/inward/record.url?scp=84930795358&partnerID=8YFLogxK

A SEMG-Force Estimation Framework Based on a Fast Orthogonal Search Method Coupled with Factorization Algorithms

Autoren: Chen, Xiang Yuan, Yuan Cao, Shuai et al.

Schlagwörter: High-density SEMG, Factorization algorithms, Fast orthogonal search, Muscle force estimation

Relation: Sensors 18 (7): 2238 (2018); http://hdl.handle.net/2429/70748

Verfügbarkeit: http://hdl.handle.net/2429/70748
https://doi.org/10.3390/s18072238

A multilevel approach for nonnegative matrix factorization

Autoren: GILLIS, Nicolas GLINEUR, François UCL - SST/ICTM/INMA - Pôle en ingénierie mathématique et al.

Weitere Verfasser: GILLIS, Nicolas GLINEUR, François UCL - SST/ICTM/INMA - Pôle en ingénierie mathématique et al.

Quelle: Journal of Computational and Applied Mathematics, Vol. 236, no. 7, p. 1708–1723 (January 2012)

Schlagwörter: Multigrid/multilevel methods, Image Processing, Applied Mathematics, 05 social sciences, Multigrid/Multilevel Methods, nonnegative matrix factorization, Numerical Analysis (math.NA), 02 engineering and technology, algorithms, Nonnegative Matrix Factorization, image processing, Nonnegative matrix factorization, Computational Mathematics, Image processing, Optimization and Control (math.OC), multigrid and multilevel methods, 0502 economics and business, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Numerical Analysis, Mathematics - Optimization and Control, nonnegative matrix factorization, algorithms, multigrid and multilevel methods, image processing

Zugangs-URL: http://arxiv.org/abs/1009.0881
http://dblp.uni-trier.de/db/journals/corr/corr1009.html#abs-1009-0881
http://ui.adsabs.harvard.edu/abs/2010arXiv1009.0881G/abstract
https://arxiv.org/abs/1009.0881
https://dblp.uni-trier.de/db/journals/jcam/jcam236.html#GillisG12
https://arxiv.org/pdf/1009.0881.pdf
https://dialnet.unirioja.es/servlet/articulo?codigo=3844022
https://hdl.handle.net/2078.1/105404
https://hdl.handle.net/2078.1/33294
http://www.uclouvain.be/cps/ucl/doc/core/documents/coredp2010_47web.pdf

Квантові алгоритми пошуку об’єктів в неупорядкованому списку

Weitere Verfasser: Королюк, Дмитро Володимирович ELAKPI

Schlagwörter: пошук об'єктів у неупорядкованому списку, quantum computers, квантові обчислення, квантові алгоритми, quantum information theory, алгоритми факторизації, factorization algorithms, quantum computing, error correction codes, квантова теорія інформації, коди корекції помилок, квантові комп'ютери, quantum algorithms, object search in an unordered list

Dateibeschreibung: application/pdf

Zugangs-URL: https://ela.kpi.ua/handle/123456789/60078

QR factorization for shared memory and message passing

Autoren: Ian N. Dunn Gerard G. L. Meyer

Quelle: Parallel Computing. 28:1507-1530

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, parallel QR factorization algorithms, 02 engineering and technology, Parallel algorithms in computer science

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1856552
https://doi.org/10.1016/s0167-8191(02)00162-x
https://www.sciencedirect.com/science/article/pii/S016781910200162X
https://dblp.uni-trier.de/db/journals/pc/pc28.html#DunnM02
https://www.sciencedirect.com/science/article/pii/S016781910200162X#!

A modification of the Dewilde–van der Veen method for inversion of finite structured matrices: A modification of the Dewilde-van der Veen method for inversion of finite structured matrices

Autoren: Israel Gohberg Yuli Eidelman

Quelle: Linear Algebra and its Applications. :419-450

Schlagwörter: Numerical Analysis, Algebra and Number Theory, Inversion algorithms, Linear complexity algorithms, structured matrices, Direct numerical methods for linear systems and matrix inversion, complexity analysis, 01 natural sciences, Factorization of matrices, matrix inversion, factorization, Discrete Mathematics and Combinatorics, Factorization algorithms, Theory of matrix inversion and generalized inverses, Geometry and Topology, 0101 mathematics, numerical experiments, Structured matrices, Solution of linear equations, system of linear equations

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0024379501003639
https://www.sciencedirect.com/science/article/abs/pii/S0024379501003639

LAWRA – LINEAR ALGEBRA WITH RECURSIVE ALGORITHMS: LAWRA -- linear algebra with recursive algorithms.

Autoren: Andersen, B. S. Gustavson, F. Karaivanov, A. et al.

Quelle: Mathematical Modelling and Analysis, Vol 4, Iss 1 (1999)
Mathematical Modelling and Analysis; Vol 4 No 1 (1999); 7-17

Schlagwörter: QA1-939, Cholesky factorization algorithms, 0101 mathematics, Symbolic computation and algebraic computation, 01 natural sciences, Mathematics

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: https://journals.vgtu.lt/index.php/MMA/article/download/9964/8648
https://zbmath.org/1810094
https://doaj.org/article/2acc6892c71648499aaeb83e5ea35cd4
https://journals.vgtu.lt/index.php/MMA/article/view/9964/8648
http://www.tandfonline.com/doi/ref/10.1080/13926292.1999.9637105
https://journals.vilniustech.lt/index.php/MMA/article/view/9964

Analysis of the Yosida method for the incompressible Navier–Stokes equations: Analysis of the Yosida method for the incompressible Navier-Stokes equations

Autoren: Alfio Quarteroni Alessandro Veneziani Fausto Saleri

Quelle: Journal de Mathématiques Pures et Appliquées. 78:473-503

Schlagwörter: Mathematics(all), Other numerical methods (fluid mechanics), Applied Mathematics, Yosida method, Navier-Stokes equations, factorization algorithms, 0101 mathematics, Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0021782499000276
https://www.sciencedirect.com/science/article/abs/pii/S0021782499000276
https://infoscience.epfl.ch/record/102911
https://re.public.polimi.it/handle/11311/513881

On the general solution by a direct method of a large‐scale singular system of linear equations: application to the analysis of floating structures: On the general solution by a direct method of a large-scale singular system of linear equations: Application to the analysis of floating structures

Autoren: Charbel Farhat Michel Géradin

Quelle: International Journal for Numerical Methods in Engineering. 41:675-696

Schlagwörter: hybrid geometric-algebraic method, Finite element methods applied to problems in solid mechanics, structural mechanics, zero energy models, factorization algorithms, Other numerical methods in solid mechanics, Direct numerical methods for linear systems and matrix inversion, domain-decomposition-based iterative solvers, 16. Peace & justice

Dateibeschreibung: application/xml

Zugangs-URL: https://onlinelibrary.wiley.com/doi/full/10.1002/%28SICI%291097-0207%2819980228%2941%3A4%3C675%3A%3AAID-NME305%3E3.0.CO%3B2-8
https://ui.adsabs.harvard.edu/abs/1998IJNME..41..675F/abstract

On some factorizations of two-parameter polynomial matrices

Autoren: V. N. Kublanovskaya

Quelle: Journal of Mathematical Sciences. 86:2866-2879

Schlagwörter: Numerical computation of eigenvalues and eigenvectors of matrices, Eigenvalues, singular values, and eigenvectors, minimal factorization, polynomial matrices, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, Factorization of matrices, degenerate rank, spectrum, Matrices over function rings in one or more variables, rank factorization algorithms, singular two-parameter polynomial matrix, spectral problems, column and row rank, 0101 mathematics

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/996274
https://zbmath.org/1364704
https://link.springer.com/article/10.1007/BF02356144
https://link.springer.com/content/pdf/10.1007/BF02356144.pdf

Efficient householder QR factorization for superscalar processors: Efficient Householder QR factorization for superscalar processors

Autoren: James J. Carrig Gerard G. L. Meyer

Quelle: ACM Transactions on Mathematical Software. 23:362-378

Schlagwörter: Numerical solutions to overdetermined systems, pseudoinverses, Householder QR factorization algorithms, least squares problem, Parallel numerical computation, Intel Pentium Pro system, 02 engineering and technology, IBM Scalable Parallel System 2, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, register model, cache model, Numerical algorithms for specific classes of architectures, adaptive filtering, 0202 electrical engineering, electronic engineering, information engineering, R8000 processor, 0101 mathematics, parallel computation

Dateibeschreibung: application/xml

Stability of Augmented System Factorizations in Interior-Point Methods: Stability of augmented system factorizations in interior-point methods

Autoren: Stephen J. Wright

Quelle: SIAM Journal on Matrix Analysis and Applications. 18:191-222

Schlagwörter: 0211 other engineering and technologies, primal-dual interior-point methods, linear programming, 02 engineering and technology, stability, factorization algorithms, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences, augmented system factorizations, large, sparse and symmetric matrix, Numerical mathematical programming methods, Linear programming, ill-conditioned linear systems, backward error analysis, 0101 mathematics, numerical experiments

Dateibeschreibung: application/xml

Zugangs-URL: https://epubs.siam.org/doi/abs/10.1137/S0895479894271093
https://dl.acm.org/doi/10.1137/S0895479894271093
https://locus.siam.org/doi/abs/10.1137/S0895479894271093

Substitutions for linear shift register sequences and the factorization algorithms of Berlekamp and Niederreiter

Autoren: Ehler Lange

Quelle: Linear Algebra and its Applications. 249:217-228

Schlagwörter: Numerical Analysis, Algebra and Number Theory, Discrete Mathematics and Combinatorics, Formal languages and automata, finite automata, Geometry and Topology, 0102 computer and information sciences, Parallel algorithms in computer science, factorization algorithms, 0101 mathematics, substitutions, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/962166
https://doi.org/10.1016/0024-3795(95)00358-4
https://core.ac.uk/display/82303942
https://www.sciencedirect.com/science/article/pii/0024379595003584

On inverse factorization adaptive least-squares algorithms

Autoren: Rontogiannis, A.A. Theodoridis, S.

Quelle: Signal Processing. 52:35-47

Schlagwörter: computational complexity, least-squares system identification, parallel algorithms, Parallel numerical computation, 02 engineering and technology, adaptive exponentially weighted algorithm, robust, numerical stability, Least squares and related methods for stochastic control systems, inverse factorization algorithms, implementations, square array architecture, 0202 electrical engineering, electronic engineering, information engineering, System identification, numerical properties, orthogonal Householder transformations

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/0165168496000606
https://pergamos.lib.uoa.gr/uoa/dl/object/3038146

High performance algorithms for Toeplitz and block Toeplitz matrices

Autoren: V. Vermaut S. Thirumalai Kyle A. Gallivan et al.

Quelle: Linear Algebra and its Applications. :343-388

Schlagwörter: high performance computing, numerical examples, Numerical Analysis, Complexity and performance of numerical algorithms, Algebra and Number Theory, block Toeplitz matrices, Schur algorithms, Discrete Mathematics and Combinatorics, QR factorization algorithms, Geometry and Topology, 0101 mathematics, Direct numerical methods for linear systems and matrix inversion, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/0024379595006494
https://www.sciencedirect.com/science/article/abs/pii/0024379595006494
https://core.ac.uk/display/20980305