Results 171 to 180 of about 82,972,811 (208)
Terahertz Channel Modeling, Estimation and Localization in RIS‐Assisted Systems
Reconfigurable intelligent surfaces have become a recent intensive research focus. Based on practical applications, channel strategies for RIS‐assisted terahertz wireless communication systems are categorized into three different types: channel modeling, channel estimation, and channel localization.
Hongjing Wang +9 more
wiley +1 more source
In this work, low‐resolution infrared imaging is combined with a 28 nm FeFET IMC architecture to enable compact, energy‐efficient edge inference. MLC FeFET devices are experimentally characterized, and controlled multi‐level current accumulation is validated at crossbar array level.
Alptekin Vardar +9 more
wiley +1 more source
On the Role of Preprocessing and Memristor Dynamics in Reservoir Computing for Image Classification
ABSTRACT Reservoir computing (RC) is an emerging recurrent neural network architecture that has attracted growing attention for its low training cost and modest hardware requirements. Memristor‐based circuits are particularly promising for RC, as their intrinsic dynamics can reduce network size and parameter overhead in tasks such as time‐series ...
Rishona Daniels +4 more
wiley +1 more source
Passive resistive memory arrays promise efficient in‐memory computing but suffer from sneak paths and programming variability. Here, highly uniform 32 × 32 passive RRAM crossbars are programmed with multilevel precision below 3% error and 99.5% yield.
S. Ricci +6 more
wiley +1 more source
Balancing Carrier Cooling in InN/GaN Quantum Wells via Point Defect Engineering
Nitrogen vacancies in the InN/GaN interface regulate carrier relaxation in polar quantum wells by reconstructing the conduction‐band decay pathway and enhancing nonadiabatic coupling. No deep midgap state is introduced in the neutral single‐vacancy model, enabling faster hot‐electron cooling, improved electron‐hole balance, reduced electron overflow ...
Yuxin Yang +5 more
wiley +1 more source
Wire resistance and sneak paths severely compromise the performance of large memristor crossbars. A predictive closed‐form distributed line‐resistance model, combined with a fourmatrix geometry‐averaging algorithm, eliminates these parasitic limitations.
Davide Rossetti +5 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Computational methods for sparse matrices
Computer Physics Communications, 1980Abstract This paper is a survey of methods currently available for processing sparse matrices in a digital computer; specifically in the solution of linear algebraic equations and the eigenproblem.
openaire +3 more sources
Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
SIAM Journal on Scientific and Statistical Computing, 1986The method of \textit{E. R. Davidson} [J. Comput. Phys. 17, 87-94 (1975; Zbl 0293.65022)] for computing a few eigenpairs of large sparse symmetric matrices is analyzed as a method for using diagonal preconditioning (i.e. using an approximate inverse).
Morgan, Ronald B., Scott, David S.
openaire +2 more sources
A hybrid method for the solution of sparse power system matrices on vector computers
38th Midwest Symposium on Circuits and Systems. Proceedings, 2002This paper describes a methodology for solving a linear system of equations on vector computer. The methodology combines direct and inverse factors. The decomposition and implementation of the direct solution in a CRAY Y-MPZE/232, and the performance results are discussed.
A. Padilha, A.R. Basso
openaire +1 more source
SIAM Journal on Scientific Computing, 2019
Summary: Obtaining high accuracy singular triplets for large sparse matrices is a significant challenge, especially when searching for the smallest triplets. Due to the difficulty and size of these problems, efficient methods must function iteratively, with preconditioners, and under strict memory constraints. In this research, we present a Golub-Kahan
Steven Goldenberg +2 more
openaire +2 more sources
Summary: Obtaining high accuracy singular triplets for large sparse matrices is a significant challenge, especially when searching for the smallest triplets. Due to the difficulty and size of these problems, efficient methods must function iteratively, with preconditioners, and under strict memory constraints. In this research, we present a Golub-Kahan
Steven Goldenberg +2 more
openaire +2 more sources

