Search Results - Numerical Algorithms and Problems—computations on matrices

Converting to and from Dilated Integers by Raman, R., Wise, D.S.

“… They are essential for programmers who would use Cartesian indexing there. Two algorithms for each casting conversion are presented here, including to-and-from dilated integers for both d = 2 and d = 3…”
Get full text

Division-free computation of subresultants using Bezout matrices by Kerber, Michael

“…]. We evaluate determinants of slightly manipulated Bezout matrices using the algorithm of Berkowitz…”
Get full text

Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms by Bullo, Francesco, Cortés, Jorge, Martínez, Sonia

“… The book presents a broad set of tools for understanding coordination algorithms, determining their correctness, and assessing their complexity…”
Get full text

New numerical treatment of source term in convective transfer of heat between fluid and porous solid matrix by Hajek, Jiri, Jurena, Tomas

“… Design/methodology/approach – The novel formulation is obtained by analytical solution of an idealized dual problem…”
Get full text

Control theoretic splines: optimal control, statistics, and path planning (princeton series in applied mathematics). by Egerstedt, Magnus, Martin, Clyde

“… In this book, they begin with a series of problems ranging from path planning to statistics to approximation…”
Get full text

Fast algorithm for structural dynamics problems using differential quadrature method and V-transformation by Fangzong, Wang, Xiaobing, Liao

“…The differential quadrature method (DQM) has been widely used for structural dynamics problems computation…”
Get full text

Complexity results for some eigenvector problems by Eiter, Thomas, Gottlob, Georg

“…We consider the computation of eigenvectors over the integers, where each component x i satisfies for an integer b. We address various problems in this…”
Get full text

A symbolic-numerical algorithm for the computation of matrix elements in the parametric eigenvalue problem by Vinitsky, S. I., Gerdt, V. P., Gusev, A. A., Kaschiev, M. S., Rostovtsev, V. A., Samoilov, V. N., Tyupikova, T. V., Chuluunbaatar, O.

“…A symbolic-numerical algorithm for the computation of the matrix elements in the parametric eigenvalue problem to a prescribed accuracy is presented…”
Get full text

Conditions for Existence, Representations, and Computation of Matrix Generalized Inverses by Gerontitis, Dimitrios, Stojanović, Igor, Ćirić, Miroslav, Stanimirović, Predrag S.

“… Algorithms arising from the introduced representations are developed. Particularly, these algorithms can be used to compute the Moore-Penrose inverse, the Drazin inverse, and the usual matrix inverse…”
Get full text

pyCTQW: A continuous-time quantum walk simulator on distributed memory computers by Izaac, Josh A., Wang, Jingbo B.

“… (continuous-time quantum walk)-based systems. In this paper, we present an introduction to the Python and Fortran interfaces of pyCTQW, discuss various numerical methods of calculating the matrix exponential, and demonstrate the performance…”
Get full text

Interval analysis : and automatic result verification by Mayer, Günter

“… in the mathematics of computation. Contents * * Preliminaries * Real intervals * Interval vectors, interval matrices…”
Get full text

A Generalized SOR Method for Dense Linear Systems of Boundary Element Equations by Davey, K., Bounds, S.

“… The parameter matrix $\Omega$ is selected to minimize the Frobenius norm $\|D - (\Omega H)_u\|_F$. Mathematical arguments and numerical experiments are presented to show that minimizing…”
Get full text

QR Decomposition Based on Double-double Precision Gram-Schmidt Orthogonalization Method by Jin, Jiexi, Xie, Hehu, Du, Peibing, Quan, Zhe, Jiang, Hao

“… and BCGS＿PIO algorithms, which proves that DDMGS algorithm can effectively reduce the loss of orthogonality of matrix, improve the numerical accuracy, and demonstrate the stability of our…”
Get full text

Low-rank traffic matrix completion with marginal information by Xiong, Zikai, Wei, Yimin, Xu, Renjie, Xu, Yanwei

“… In this paper, we utilize such marginal information to largely improve the performance of common matrix completion algorithms and propose an alternating direction method of multipliers (ADMM…”
Get full text

On the computation of intrinsic Proper Generalized Decomposition modes of parametric symmetric elliptic problems on Grassmann manifolds by Bandera, Alejandro, Fernández-García, Soledad, Gómez-Mármol, Macarena

“…In this work, we introduce an iterative optimization algorithm to obtain the intrinsic Proper Generalized Decomposition modes of elliptic partial differential equations…”
Get full text

The nearest graph Laplacian in Frobenius norm by Sato, Kazuhiro, Suzuki, Masato

Get full text

Optimisation of Automatic Matrix Multiplication Mixing Accuracy Based on Polyhedral Models by HE Haotian, ZHOU Bei, GUO Shaozhong, ZHANG Zuoyan, HAO Jiangwei, XU Jinchen

“…Mixed precision is a numerical computation technique in computers that improves the efficiency of computation by converting some of the data types in the computation from high precision to low…”
Get full text

Total positivity and least squares problems in the Lagrange basis by Marco, Ana, Martínez, José‐Javier, Viaña, Raquel

“…‐Vandermonde matrices are used to take advantage of total positivity in the construction of accurate algorithms to solve the considered problem…”
Get full text

Minimum Fill-in of Sparse Graphs: Kernelization and Approximation by Fomin, Fedor V., Philip, Geevarghese, Villanger, Yngve

“… The problem has important applications in numerical algebra, in particular in sparse matrix computations…”
Get full text

Diffraction theory: application of the fast Fourier factorization to cylindrical devices with arbitrary cross section lighted in conical mounting by Boyer, Philippe, Popov, Evgeny, Nevière, Michel, Renversez, Gilles

“… The resolution of the boundary-value problem, including an adapted S-matrix propagation algorithm, is explained in detail for the case of an isotropic medium…”
Get more information