Results 41 to 50 of about 164,297 (154)

Real-Time Operator Evolution in Two and Three Dimensions via Sparse Pauli Dynamics

PRX Quantum
We study real-time operator evolution using sparse Pauli dynamics, a recently developed method for simulating expectation values of quantum circuits. On the examples of energy and charge diffusion in one-dimensional (1D) spin chains and sudden quench ...
Tomislav Begušić, Garnet Kin-Lic Chan
doaj   +1 more source

Improvement of the finite element method equations conditioning for the magnetic field-circuital problems

Archives of Electrical Engineering, 2017
The presented systems with magnetically coupled windings are solved with the finite element method. If the issue of voltage supply is analyzed, a system of linear equations with a partially skew-symmetric sparse matrix is obtained. Iterative methods used
Gołębiowski Marek
doaj   +1 more source

Application of the Double Approximation Method for Constructing Stiffness Matrices of Volumetric Finite Elements

Advanced Engineering Research, 2023
Introduction. When numerically solving problems of elasticity theory in a three-dimensional formulation by the finite element method, finite elements (FE) in the form of parallelepipeds, prisms and tetrahedra are used.
P. P. Gaidzhurov, N. A. Saveleva
doaj   +1 more source

A Decomposition-Based Approach for the Multiperiod Multiproduct Distribution Planning Problem

Journal of Applied Mathematics, 2014
We address the most general case of multiperiod, multiproduct network planning problems, where we allow spoilage on arcs and storage at nodes. In our models, all network parameters change over time and products.
S. Ahmad Hosseini, Güvenç Şahin, Tonguç Ünlüyurt   +2 more
doaj   +1 more source

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices

Numerische Mathematik, 1993
We describe a block version of Arnoldi's method for computing a few eigenvalues with largest or smallest real parts. The method is accelerated via Chebyshev iteration and a procedure is developed to identify the optimal ellipse which encloses the spectrum.
openaire   +2 more sources

Efficient cross-validation traversals in feature subset selection

Scientific Reports, 2022
Sparse and robust classification models have the potential for revealing common predictive patterns that not only allow for categorizing objects into classes but also for generating mechanistic hypotheses.
Ludwig Lausser, Robin Szekely, Florian Schmid, Markus Maucher, Hans A. Kestler   +4 more
doaj   +1 more source

Phylogenetic Stochastic Mapping without Matrix Exponentiation

, 2014
Phylogenetic stochastic mapping is a method for reconstructing the history of trait changes on a phylogenetic tree relating species/organisms carrying the trait. State-of-the-art methods assume that the trait evolves according to a continuous-time Markov
Irvahn, Jan, Minin, Vladimir N.
core   +1 more source

Exploiting the structure effectively and efficiently in low rank matrix recovery

, 2018
Low rank model arises from a wide range of applications, including machine learning, signal processing, computer algebra, computer vision, and imaging science.
Absil, Agarwal, Ahmed, Alter, Amelunxen, Beck, Blanchard, Blumensath, Boumal, Boyd, Bunk, Cai, Cai, Cai, Cai, Cai, Cai, Candes, Candes, Candes, Candes, Candes, Candès, Candès, Candès, Candès, Carmon, Chandrasekaran, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Chen, Combettes, Davenport, Davenport, Ding, Donoho, Fazel, Ge, Ge, Ge, Goldberg, Gross, Hardt, Harrison, Huang, Jaggi, Jain, Jain, Ji, Jin, Keshavan, Kim, Kliesch, Koltchinskii, Krim, Kueng, Lanman, Li, Li, Lin, Ling, Ling, Liu, Liu, Lustig, Ma, Miao, Mishra, Mishra, Mishra, Mobahi, Mu, Negahban, Netrapalli, Ngo, Potter, Qu, Recht, Recht, Schermelleh, Srebro, Strohmer, Sun, Sun, Tanner, Tanner, Tao, Tharrault, Toh, Toh, Tomasi, Tu, Vandereycken, Wang, Wei, Wei, Wei, Wen, WenHuang, Xu, Yi, Zhang, Zhang, Zheng   +109 more
core   +2 more sources

A sparse implementation of the Frisch-Newton algorithm for 1uantile regression: Working paper series--03-03 [PDF]

, 2003
Recent experience has shown that interior-point methods using a log barrier approach are far superior to classical simplex methods for computing solutions to large parametric quantile regression problems.
Koenker, Roger, Ng, Pin
core  

Singular Value Decomposition-Based Adaptive Sampling Approximate Message Passing Net for Sparse-View CT Reconstruction

IEEE Photonics Journal
Sparse-viewcomputed tomography (CT) imaging is a promising technique for reducing radiation dose and accelerating data acquisition in medical imaging.
Zhenhua Wu, Jiafei Xu, Lixia Yang
doaj   +1 more source