Results 41 to 50 of about 341,424 (240)
Journal of Applied Mathematics, 2013 We propose a new iterative method to find the bisymmetric minimum norm solution of a pair of consistent matrix equations A1XB1=C1, A2XB2=C2. The algorithm can obtain the bisymmetric solution with minimum Frobenius norm in finite iteration steps in the ...
Aijing Liu +2 more
doaj +1 more source
Retrospective Grid Cells in the Medial Entorhinal Cortex Encode Past Paths During Spatial Navigation
Advanced Science, EarlyView.Retrospective grid cells are identified in the medial entorhinal cortex, with spatial firing patterns that become most grid‐like when activity is projected onto recently traversed locations. Their coding loses spatial precision in darkness and is disrupted during assisted movement, indicating that entorhinal representations incorporate recent path ...
Ruojin Liu +10 more
wiley +1 more source
On Skew Circulant Type Matrices Involving Any Continuous Fibonacci Numbers
Abstract and Applied Analysis, 2014 Circulant and skew circulant matrices have become an important tool in networks engineering. In this paper, we consider skew circulant type matrices with any continuous Fibonacci numbers.
Zhaolin Jiang, Jinjiang Yao, Fuliang Lu
doaj +1 more source
Lower bounds for quantum-inspired classical algorithms via communication complexity [PDF]
QuantumQuantum-inspired classical algorithms provide us with a new way to understand the computational power of quantum computers for practically-relevant problems, especially in machine learning.
Nikhil S. Mande, Changpeng Shao
doaj +1 more source
H-infinity control for discrete-time linear systems with Frobenius norm-bounded uncertainties
, 1998 H∞ control for discrete-time linear systems with Frobenius norm-bounded ...
Boukas, El-Kébir +6 more
core +1 more source
Advanced Science, EarlyView.This Perspective charts the modeling landscape for soft manipulators, spanning sparse system identification, neural dynamics, physics‐informed models and hybrid intelligence. We examine how physics, data, sensing, adaptation and control can assume complementary roles within this landscape, and provide a framework for selecting modeling approaches ...
Wenbo Hui +4 more
wiley +1 more source
Deep Fuzzy Clustering Network With Matrix Norm Regularization
IEEE AccessRecently, deep clustering networks, which able to learn latent embedding and clustering assignment simultaneously, attract lots of attention. Among the deep clustering networks, the suitable regularization term is not only beneficial to training of ...
Feiyu Chen, Yan Li, Wei Wang
doaj +1 more source
A note on the best approximate solution of the equation AXB-C=0
上海师范大学学报. 自然科学版, 2018 A counterexample is constructed which shows that with respect to the 2-norm,there exist matrices A,B and C such that A† CB† fails to be the best approximate solution of the equation AXB-C=0,where A† and B† are the Moore-Penrose ...
Song Chuanning, Xu Qingxiang
doaj +1 more source
Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection [PDF]
SIAM Journal on Matrix Analysis and Applications, 2020 A CUR approximation of a matrix $A$ is a particular type of low-rank approximation $A\approx CUR$, where $C$ and $R$ consist of columns and rows of $A$, respectively. One way to obtain such an approximation is to apply column subset selection to $A$ and $A^T$.
Alice Cortinovis, Daniel Kressner
openaire +4 more sources
STRIDE: A Sequencing Depth Robust Metric for Sparse Chromosome Conformation Capture Data Comparison
Advanced Science, EarlyView.A mean first passage time (MFPT)‐based representation transforms sparse Hi‐C contact maps into robust topological representations, preserving biologically meaningful chromatin features and facilitating robust analysis of TADs, chromatin loops, differential chromatin contacts, and sparse single‐cell Hi‐C data.
Bingxiang Xu +4 more
wiley +1 more source