Related papers: Efficient Computation of Redundancy Matrices for M…
This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic…
Quantifying structural stress in transaction networks requires metrics that capture structural organization beyond transaction volume alone. In this work, we introduce the Inefficiency Metric, a deterministic indicator designed to…
Gradient descent optimizations and backpropagation are the most common methods for training neural networks, but they are computationally expensive for real time applications, need high memory resources, and are difficult to converge for…
In order to improve the fault diagnosis capability of multivariate statistical methods, this article introduces a fault isolation framework based on structured sparsity modeling. The developed method relies on the reconstruction based…
We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…
In this paper, we introduce novel fast matrix inversion algorithms that leverage triangular decomposition and recurrent formalism, incorporating Strassen's fast matrix multiplication. Our research places particular emphasis on triangular…
The dynamics of cross-diffusion models leads to a high computational complexity for implicit difference schemes, turning them unsuitable for tasks that require results in real-time. We propose the use of two operator splitting schemes for…
Taking partial traces for computing reduced density matrices, or related functions, is a ubiquitous procedure in the quantum mechanics of composite systems. In this article, we present a thorough description of this function and analyze the…
This paper presents a computational framework for the robust stiffness design of hyperelastic structures at finite deformations subject to various uncertain sources. In particular, the loading, material properties, and geometry…
Convolutional neural networks (CNN) are generally designed with a heuristic initialization of network architecture and trained for a certain task. This often leads to overparametrization after learning and induces redundancy in the…
Consider a rectangular matrix describing some type of communication or transportation between a set of origins and a set of destinations, or a classification of objects by two attributes. The problem is to infer the entries of the matrix…
We introduce a path sampling method for the computation of rate constants for systems with a highly diffusive character. Based on the recently developed algorithm of transition interface sampling (TIS) this procedure increases the…
This paper presents a generalized theory which describes how applied loads are distributed within rigid bodies handled by redundantly-actuated robotic systems composed of multiple independent closed-loop kinematic chains. The theory fully…
This paper proposes a simple approach to derive efficient error bounds for learning multiple components with sparsity-inducing regularization. We show that for such regularization schemes, known decompositions of the Rademacher complexity…
Data generated in the fields of science, technology, business and in many other fields of research are increasing in an exponential rate. The way to extract knowledge from a huge set of data is a challenging task. This paper aims to propose…
We study the allocation strategies for redundant components in the load-sharing series/parallel systems. We show that under the specified assumptions, the allocation of a redundant component to the stochastically weakest (strongest)…
To provide robustness of distributed model predictive control (DMPC), this work proposes a robust DMPC formulation for discrete-time linear systems subject to unknown-but-bounded disturbances. Taking advantage of the structure of certain…
Long Short-Term Memory (LSTM) is a special class of recurrent neural network, which has shown remarkable successes in processing sequential data. The typical architecture of an LSTM involves a set of states and gates: the states retain…
Many countries are currently challenged with the extensive integration of renewable energy sources, which necessitates vast capacity expansion measures. These measures in turn require comprehensive power flow studies, which are often…
An efficient method is proposed for computing the structure of Jordan blocks of a matrix of integers or rational numbers by exact computation. We have given a method for computing Jordan chains of a matrix with exact computation. However,…