Results 31 to 40 of about 3,814,069 (243)

Parallel sparse matrix solution for direct circuit simulation on a multiple FPGA system [PDF]

open access: yes, 2012
SPICE, from the University of California, at Berkeley, is the de facto world standard for circuit simulation. SPICE is used to model the behaviour of electronic circuits prior to manufacturing to decrease defects and hence reduce costs. However, accurate
Nechma, Tarek
core   +1 more source

Periodic Reordering [PDF]

open access: yes, 1988
For many networks in nature, science and technology, it is possible to order the nodes so that most links are short-range, connecting near-neighbours, and relatively few long-range links, or shortcuts, are present.
Calvo, M.C.   +62 more
core   +3 more sources

A New Estimation Algorithm for Frequency and Amplitude in Harmonic Signal Processing

open access: yesIEEE Access, 2020
Low-rank matrix recovery is a large-scale data analysis and processing technology; its related theory has been widely used in image restoration, image denoising, video background modeling, signal recovery and other fields. This paper proposes an improved
Yanbo Mai   +4 more
doaj   +1 more source

Adaptive processing with signal contaminated training samples [PDF]

open access: yes, 2013
We consider the adaptive beamforming or adaptive detection problem in the case of signal contaminated training samples, i.e., when the latter may contain a signal-like component.
Bidon, Stéphanie   +3 more
core   +1 more source

Bidiagonalization of (k, k + 1)-tridiagonal matrices

open access: yesSpecial Matrices, 2019
In this paper,we present the bidiagonalization of n-by-n (k, k+1)-tridiagonal matriceswhen n < 2k. Moreover,we show that the determinant of an n-by-n (k, k+1)-tridiagonal matrix is the product of the diagonal elements and the eigenvalues of the matrix ...
Takahira S., Sogabe T., Usuda T.S.
doaj   +1 more source

Consistent Block Diagonal and Exclusive Multi-view Subspace Clustering [PDF]

open access: yesJisuanji kexue
Subspace clustering method provides an effective solution to the clustering problem of high-dimensional multi-view data.Focusing on the issue that the representation matrix cannot obey the block diagonal property directly by using low rank or sparse ...
WU Jie, WAN Yuan, LIU Qiujie
doaj   +1 more source

Approximating a similarity matrix by a latent class model: A reappraisal of additive fuzzy clustering [PDF]

open access: yes, 2009
Let Q be a given n×n square symmetric matrix of nonnegative elements between 0 and 1, similarities. Fuzzy clustering results in fuzzy assignment of individuals to K clusters.
Braak, C.J.F., ter   +3 more
core   +1 more source

Emerging experimental and computational methods for studying redox‐regulated structural transitions

open access: yesFEBS Letters, EarlyView.
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass   +2 more
wiley   +1 more source

Estatuts del Consorci del Campus Diagonal-Besòs [2021 text refós]

open access: yes, 2021
Aprovat pel Consell del Consorci del Campus Interuniversitari Diagonal-Besòs de 28-01-2021Canvi de nom.
Consorci del Campus Diagonal-Besòs
core   +1 more source

Lanczos algorithm explained in statistics

open access: yesResults in Applied Mathematics
The Lanczos algorithm is a well-known three-term recurrence that can be used to generate an orthogonal basis for a Krylov subspace derived by a symmetric matrix.
Qiang Niu, Mianmian Chen, Jinheng Wu
doaj   +1 more source

Home - About - Disclaimer - Privacy