Suchergebnisse - "Lanczos algorithm"

FastSKAT: Sequence kernel association tests for very large sets of markers von Lumley, Thomas, Brody, Jennifer, Peloso, Gina, Morrison, Alanna, Rice, Kenneth

“… Extracting the full set of eigenvalues of this matrix (an n×n matrix, for n subjects) has computational complexity proportional to n3 …”
Volltext

A Lanczos-like method for non-autonomous linear ordinary differential equations von Giscard, Pierre-Louis, Pozza, Stefano

“… The ∗ -Lanczos algorithm is a (symbolic) algorithm capable of evaluating it by producing a tridiagonalization of the original differential system …”
Volltext

Development of numerical linear algebra algorithms in dynamic fixed-point format: a case study of Lanczos tridiagonalization von Pradhan, Tapan, Kabi, Bibek, Mohanty, Ramanarayan, Routray, Aurobinda

“… Summary Proper range and precision analysis play an important role in the development of fixed‐point algorithms for embedded system applications. Numerical …”
Volltext

RESTARTING TECHNIQUES FOR THE LANCZOS ALGORITHM AND THEIR IMPLEMENTATION IN PARALLEL COMPUTING ENVIRONMENTS: ARCHITECTURAL INFLUENCES von SZULARZ, M., WESTON, J., CLINT, M.

“… The Lanczos algorithm is one of the principal algorithms for the computation of a few of the extreme eigenvalues and their corresponding eigenvectors of very large, sparse, symmetric matrices …”
Volltext

Numerical implementation of the QMR algorithm by using discrete stochastic arithmetic von Toutounian, Faezeh, Salkuyeh, Davod Khojasteh, Asadi, Bahram

“… ∈. The subject of this paper is to show how discrete stochastic arithmetic remedies the problem of this tolerance, as well as the problem of the other tolerances which are needed in the other checks of the QMR method with the estimation of the accuracy of some intermediate results. Numerical examples are used to show the good numerical properties …”
Volltext

Towards Verifications of Krylov Complexity von Sasaki, Ryu

“… (·, ·) of the operators, the orthonormal basis $\lbrace \mathcal {O}_n\rbrace$ is constructed from $\mathcal {O}_0=\eta /\sqrt{(\eta ,\eta )}$ by the Lanczos algorithm …”
Volltext

Probing the entanglement of operator growth von Patramanis, Dimitrios

“… Abstract In this work we probe the operator growth for systems with Lie symmetry using tools from quantum information. Namely, we investigate the Krylov …”
Volltext

Krylov complexity and orthogonal polynomials von Mück, Wolfgang, Yang, Yi

“… The construction of that basis relies on the Lanczos algorithm, also known as the recursion method …”
Volltext

Dirac electrons in graphene-based quantum wires and quantum dots von Peres, N M R, Rodrigues, J N B, Stauber, T, Lopes Dos Santos, J M B

“… In this paper we analyse the electronic properties of Dirac electrons in finite-size ribbons and in circular and hexagonal quantum dots. We show that due to …”
Weitere Angaben

A Lanczos-like method for non-autonomous linear ordinary differential equations von Pierre-Louis Giscard, Pozza, Stefano

“… The *-Lanczos algorithm is a (symbolic) algorithm capable of evaluating it by producing a tridiagonalization of the original differential system …”
Volltext

Sparsity dependence of Krylov state complexity in the SYK model von Jha, Raghav G., Roy, Ranadeep

“… The critical value of k below which the model ceases to be holographic, denoted k c , has been subject of several recent investigations …”
Volltext

Singular-Vector Perturbation Growth in a Primitive Equation Model with Moist Physics von Ehrendorfer, Martin, Errico, Ronald M., Raeder, Kevin D.

“… Finite-time growth of perturbations in the presence of moist physics (specifically, precipitation) is investigated using singular vectors (SVs) in the context …”
Volltext

Spread complexity for measurement-induced non-unitary dynamics and Zeno effect von Bhattacharya, Aranya, Das, Rathindra Nath, Dey, Bidyut, Erdmenger, Johanna

“… We apply this construction to the one-dimensional tight-binding Hamiltonian subject to repeated measurements at fixed small time intervals, resulting in effective non-unitary dynamics …”
Volltext

A semidefinite framework for trust region subproblems with applications to large scale minimization von Rendl, Franz, Wolkowicz, Henry

Volltext

Solution of Nonlinear Eigenvalue Problems Arising from Constrained Rayleigh Quotient Optimization and Resonant Modes Computation of Accelerator Cavity von Zhou, Yunshen

“… ) to minimize x'Ax subject to x'x=1 and C'x=b, where A is an n*n real symmetric matrix and C is an n …”
Volltext

Krylov complexity and orthogonal polynomials von Mück, Wolfgang, Yang, Yi

“… The construction of that basis relies on the Lanczos algorithm, also known as the recursion method …”
Volltext

Quantum Simulation Algorithms with Applications to Quantum Error Correction and Topological Data Analysis von Rajput, Abhishek

“… This thesis presents three results of relevance to the simulation of quantum dynamics on quantum computers. The first is the development of hybridized methods …”
Volltext

On Krylov Complexity von Sánchez-Garrido, A

“… Namely, an extensive introduction to the Lanczos algorithm, its properties and associated algebraic structures, as well as technical details related to its practical implementation, is given …”
Volltext

Blind Linear Interference Suppression Based on Reduced-Rank Least-Squares Constrained Constant Modulus Design for DS-CDMA Systems von de Lamare, R. C., Haardt, M., Sampaio-Neto, R.

“… Based on this design approach and using the Lanczos algorithm, a multistage decomposition in the Krylov subspace is devised for blind reduced-rank parameter estimation …”
Volltext

Linear Constrained Rayleigh Quotient Optimization: Theory and Algorithms von Zhou, Yunshen, Bai, Zhaojun, Ren-Cang, Li

“… We consider the following constrained Rayleigh quotient optimization problem (CRQopt) $$ \min_{x\in \mathbb{R}^n} x^{T}Ax\,\,\mbox{subject to}\,\, x^{T}x=1\,\mbox{and}\,C^{T}x=b, $$ where \(A\) is an \(n\times n\) real symmetric matrix …”
Volltext