Results 121 to 130 of about 23,727,129 (258)
Two Algorithms for the The Efficient Computation of Truncated Pivoted QR Approximations to a Sparse Matrix [PDF]
In this note we propose two algorithms to compute truncated pivoted QR approximations to a sparse matrix. One is based on the Gram--Schmidt algorithm, and the other on Householder triangularization.
Stewart, G. W.
core +1 more source
Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble Architectures
In a multiprocessor with distributed storage the data structures have a significant impact on the communication complexity. In this paper we present a few algorithms for performing matrix transposition on a Boolean $n$-cube.
Johnsson, Lennart,, Ho, Ching-Tien
core +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
MATRIX FACTORIZATION FOR FAST DCT ALGORITHMS
Two principles to produce new possibilities for the radix-2 Discrete Cosine Transform (DCT) have been presented in this paper. One is to employ matrix factorization through revealing the intrinsic relationship among several existing famous algorithms ...
B Chao Xu A, Pengwei Hao, Wenjia Yuan
core
A numerical–experimental framework is developed for characterizing multi‐matrix fiber‐reinforced polymers (MM‐FRPs) combining epoxy and polyurethane matrices. Harmonic bending tests are integrated with finite element model updating (FEMU) to simultaneously identify elastic and viscoelastic material parameters.
Rodrigo M. Dartora +4 more
wiley +1 more source
Copper‐based composites enhanced with carbon feature convenient mechanical properties and favorable electric conductivity. Processing via deformation and thermomechanical treatments can introduce advantageous microstructures further enhancing their performance. Herein, copper–graphene powder‐based composites are directly consolidated via rotary swaging
Radim Kocich +3 more
wiley +1 more source
On the Parallel Complexity of Matrix Factorization Algorithms
ll;eprove allulllberof negaLive resultsahout practicaf (i.e., numerically accurate) algorithms for certain matrix factorization. In particular. we prow that the popular (;iwns’ method for computing the QR decomposition is inherentl} sequential over ...
G. MANZINI +5 more
core +1 more source
A combined experimental–computational framework identifies energy‐dependent laser absorptivity for NiTi in laser powder‐bed fusion, applicable to conduction and transition modes. Single‐track experiments and thermofluid smoothed particle hydrodynamics simulations are coupled through inverse analysis of melt pool geometry.
Mohamadreza Afrasiabi +3 more
wiley +1 more source
Research on compound twill generation algorithm based on moving matrix.
To further enhance the authenticity of yarn simulation, we propose an algorithm for generating Compound Twills based on a moving matrix. Firstly, the key to designing composite twill is to determine the fly count.
Xiaobo Yang
doaj +1 more source
Experiments and thermophysical simulations were conducted to investigate the electron beam powder bed fusion electron beam (PBF‐EB/M) process for the γ′‐strengthened nickel‐based superalloy Inconel 738LC. The results demonstrate the impact of process‐induced microstructural variations on high‐temperature mechanical behavior, providing a basis for ...
Jan Niklas Petenati +11 more
wiley +1 more source

