A method for solving a system of linear equations with a symmetric indefinite coefficient matrix

2016 ◽  
Vol 34 (48/07) ◽  
Author(s):  
Izabela Czochralska
Keyword(s):  
Linear Equations ◽  
Coefficient Matrix ◽  
System Of Linear Equations

scholarly journals Publicly verifiable and efficiency/security-adjustable outsourcing scheme for solving large-scale modular system of linear equations

2019 ◽  
Vol 8 (1) ◽  
Author(s):  
Panpan Meng ◽  
Chengliang Tian ◽  
Xiangguo Cheng
Keyword(s):  
Coding Theory ◽  
Large Scale ◽  
High Efficiency ◽  
Linear Equations ◽  
Coefficient Matrix ◽  
Secure Computation ◽  
Modular System ◽  
System Of Linear Equations ◽  
Public Verifiability ◽  
Cloud Server

AbstractSolving large-scale modular system of linear equations ($\mathcal {LMSLE}$ℒℳSℒE) is pervasive in modern computer and communication community, especially in the fields of coding theory and cryptography. However, it is computationally overloaded for lightweight devices arisen in quantity with the dawn of the things of internet (IoT) era. As an important form of cloud computing services, secure computation outsourcing has become a popular topic. In this paper, we design an efficient outsourcing scheme that enables the resource-constrained client to find a solution of the $\mathcal {LMSLE}$ℒℳSℒE with the assistance of a public cloud server. By utilizing affine transformation based on sparse unimodular matrices, our scheme has three merits compared with previous work: 1) Our scheme is efficiency/security-adjustable. Our encryption method is dynamic, and it can balance the security and efficiency to match different application scenarios by skillfully control the number of unimodular matrices. 2) Our scheme is versatile. It is suit for generic m-by-n coefficient matrix A, no matter it is square or not. 3) Our scheme satisfies public verifiability and achieves the optimal verification probability. It enables any verifier which is not necessarily the client to verify the correctness of the results returned from the cloud server with probability 1. Finally, theoretical analysis and comprehensive experimental results confirm our scheme’s security and high efficiency.

scholarly journals A Note on Parallel Distinguishability of two Quantum Operations

2020 ◽  
Vol 36 (36) ◽  
pp. 198-209
Author(s):  
Chi-Kwong Li ◽  
Yue Liu ◽  
Chao Ma ◽  
Diane Pelejo
Keyword(s):  
Linear System ◽  
Nonnegative Solution ◽  
Linear Equations ◽  
Homogeneous System ◽  
Coefficient Matrix ◽  
Real Parameter ◽  
System Of Linear Equations ◽  
Quantum Operations ◽  
Nonnegative Solutions ◽  
Necessity Part

In this work, the authors consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} \mathbf{x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a real parameter $\alpha$. It was conjectured by Duan et al. that the system has a non-trivial nonnegative solution if and only if $\alpha$ lies in a certain interval $R_N$ depending on $N$. The authors affirm the necessity part of the conjecture and establish the sufficiency of the conjecture for $N\leq 10$ by presenting explicit non-trivial nonnegative solutions for the linear system.

scholarly journals LU Decomposition Scheme for Solving m-Polar Fuzzy System of Linear Equations

2020 ◽  
Vol 2020 ◽  
pp. 1-19 ◽  
Author(s):  
Ali N. A. Koam ◽  
Muhammad Akram ◽  
Ghulam Muhammad ◽  
Nawab Hussain
Keyword(s):  
Fuzzy System ◽  
Matrix Theory ◽  
Linear Equations ◽  
Coefficient Matrix ◽  
Least Square ◽  
System Of Linear Equations ◽  
Fuzzy Matrix ◽  
Decomposition Scheme ◽  
Symmetric Positive Definite ◽  
Generalized Inverse Matrix

This paper presents a new scheme for solving m-polar fuzzy system of linear equations (m-PFSLEs) by using LU decomposition method. We assume the coefficient matrix of the system is symmetric positive definite, and we discuss this point in detail with some numerical examples. Furthermore, we investigate the inconsistent m×nm-polar fuzzy matrix equation (m-PFME) and find the least square solution (LSS) of this system by using generalized inverse matrix theory. Moreover, we discuss the strong solution of m-polar fuzzy LSS of the inconsistent m-PFME. In the end, we present a numerical example to illustrate our approach.

scholarly journals Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization

2021 ◽  
Author(s):  
David Ek ◽  
Anders Forsgren
Keyword(s):  
Approximate Solution ◽  
Interior Point ◽  
Interior Point Methods ◽  
Linear Equations ◽  
Approximate Solutions ◽  
System Of Nonlinear Equations ◽  
Intermediate Step ◽  
System Of Linear Equations ◽  
Constrained Nonlinear Optimization ◽  
Asymptotic Error

AbstractThe focus in this paper is interior-point methods for bound-constrained nonlinear optimization, where the system of nonlinear equations that arise are solved with Newton’s method. There is a trade-off between solving Newton systems directly, which give high quality solutions, and solving many approximate Newton systems which are computationally less expensive but give lower quality solutions. We propose partial and full approximate solutions to the Newton systems. The specific approximate solution depends on estimates of the active and inactive constraints at the solution. These sets are at each iteration estimated by basic heuristics. The partial approximate solutions are computationally inexpensive, whereas a system of linear equations needs to be solved for the full approximate solution. The size of the system is determined by the estimate of the inactive constraints at the solution. In addition, we motivate and suggest two Newton-like approaches which are based on an intermediate step that consists of the partial approximate solutions. The theoretical setting is introduced and asymptotic error bounds are given. We also give numerical results to investigate the performance of the approximate solutions within and beyond the theoretical framework.

scholarly journals A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization

2014 ◽  
Vol 2014 ◽  
pp. 1-6
Author(s):  
Zhijun Luo ◽  
Lirong Wang
Keyword(s):  
Constrained Optimization ◽  
Optimization Problems ◽  
Linear Equations ◽  
Coefficient Matrix ◽  
Descent Direction ◽  
Constrained Optimization Problems ◽  
Inequality Constrained Optimization ◽  
Globally Convergent ◽  
Variable Distribution ◽  
Systems Of Linear Equations

A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.

scholarly journals Numerical approximation for the solution of linear sixth order boundary value problems by cubic B-spline

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
A. Khalid ◽  
M. N. Naeem ◽  
P. Agarwal ◽  
A. Ghaffar ◽  
Z. Ullah ◽  
...  
Keyword(s):  
Numerical Approximation ◽  
Analytic Solution ◽  
Linear Equations ◽  
Computational Cost ◽  
Spline Method ◽  
System Of Linear Equations ◽  
Approximation Solution ◽  
B Spline ◽  
Novel Technique ◽  
Derivatives Of

AbstractIn the current paper, authors proposed a computational model based on the cubic B-spline method to solve linear 6th order BVPs arising in astrophysics. The prescribed method transforms the boundary problem to a system of linear equations. The algorithm we are going to develop in this paper is not only simply the approximation solution of the 6th order BVPs using cubic B-spline, but it also describes the estimated derivatives of 1st order to 6th order of the analytic solution at the same time. This novel technique has lesser computational cost than numerous other techniques and is second order convergent. To show the efficiency of the proposed method, four numerical examples have been tested. The results are described using error tables and graphs and are compared with the results existing in the literature.

scholarly journals Hybrid Bernstein Block-Pulse Functions Method for Second Kind Integral Equations with Convergence Analysis

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Mohsen Alipour ◽  
Dumitru Baleanu ◽  
Fereshteh Babaei
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Convergence Analysis ◽  
Bernstein Polynomials ◽  
Linear Equations ◽  
The Other ◽  
New Combination ◽  
System Of Linear Equations ◽  
Numerical Examples ◽  
Block Pulse Functions

We introduce a new combination of Bernstein polynomials (BPs) and Block-Pulse functions (BPFs) on the interval [0, 1]. These functions are suitable for finding an approximate solution of the second kind integral equation. We call this method Hybrid Bernstein Block-Pulse Functions Method (HBBPFM). This method is very simple such that an integral equation is reduced to a system of linear equations. On the other hand, convergence analysis for this method is discussed. The method is computationally very simple and attractive so that numerical examples illustrate the efficiency and accuracy of this method.

Sign in / Sign up

Export Citation Format

Share Document