Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 4 of 4
Full-Text Articles in Entire DC Network
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Doctoral Theses
The linear complementarity problem is a fundamental problem that arises in optimization, game theory, economics, and engineering. It can be stated as follows:Given a square matrix A of order n with real entries and an n dimensional vector q, find n dimensional vectors w and z satisfying w − Az = q, w ≥ 0, z ≥ 0 (1.1.1) w t z = 0. (1.1.2)This problem is denoted as LCP(q, A). The name comes from the condition (1.1.2), the complementarity condition which requires that at least one variable in the pair (wj , zj ) should be equal to 0 …
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Doctoral Theses
No abstract provided.
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
Theses Digitization Project
This paper is intended as a professional developmental tool to help secondary algebra teachers understand the concepts underlying the algorithms we use, how these algorithms developed, and why they work. It uses a historical perspective to highlight many of the concepts underlying modern equation solving.
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
We investigate some simple finite element discretizations for the axisymmetric Laplace equation and the azimuthal component of the axisymmetric Maxwell equations as well as multigrid algorithms for these discretizations. Our analysis is targeted at simple model problems and our main result is that the standard V-cycle with point smoothing converges at a rate independent of the number of unknowns. This is contrary to suggestions in the existing literature that line relaxations and semicoarsening are needed in multigrid algorithms to overcome difficulties caused by the singularities in the axisymmetric Maxwell problems. Our multigrid analysis proceeds by applying the well known regularity …