Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 643 for “"Linear Equations"”.

  1. Rado Numbers for Two Systems of Linear Equations

    … solution to E. Let Ek be a system of k equations of the aforementioned form, where Ei represents the ith equation in Ek and the set I = {1, 2, . . . , k} is the set of indices of these equations. This thesis shows that the two-color Rado number R2(E) for the system of equations is R2(E) …

    sdstate Repository record for Rado Numbers for Two Systems of Linear Equations (opens in a new tab)

  2. Solution of linear equations and the inversion of matrices

    It has been noted that the writing of a system of linear equations in matrix form quite naturally suggests the computation of an inverse matrix which may then be used to compute solutions to a system of equations in which the coefficients remain the same but the constants have been changed. The …

    bu Repository record for Solution of linear equations and the inversion of matrices (opens in a new tab)

  3. The numerical solution of ill-conditioned systems of linear equations

    <p>The physical origins of ill-posed problems are discussed, and the computational difficulties involved in their solution are examined. An iterative suboptimal constrained estimation method for solving such problems is presented and several related methods are surveyed. An extensive bibliography …

    ut-knoxville Repository record for The numerical solution of ill-conditioned systems of linear equations (opens in a new tab)

  4. Rank modification method for certain singular systems of linear equations

    … computing a solution to the consistent system of linear equations</p> <p>Aw = f</p> <p>where A is a real matrix of order n, with rank n - 1, and f is a real n-dimensional vector. The algorithm, called the Rank Modification Method, is based upon the transformation of A into a nonsingular matrix by …

    utk-theses Repository record for Rank modification method for certain singular systems of linear equations (opens in a new tab)

  5. On minimal support solutions of underdetermined systems of linear equations

    … solutions of underdetermined systems of linear equations. First, methods for directly solving the problem are evaluated for effectiveness, and cases are shown to demonstrate that these direct methods are unreliable for finding minimal support solutions. The NP-Hardness of minimal-support …

    iastate Repository record for On minimal support solutions of underdetermined systems of linear equations (opens in a new tab)

  6. Restarting the Lanczos algorithm for large eigenvalue problems and linear equations.

    … large matrices and in solving large systems of linear equations. Restarted versions of both the symmetric and nonsymmetric Lanczos algorithms are given. For the symmetric case, we give a method called Lan-DR that simultaneously solves linear equations and computes eigenvalues and eigenvectors. …

    baylor Repository record for Restarting the Lanczos algorithm for large eigenvalue problems and linear equations. (opens in a new tab)

  7. Identification of students' errors made in the solution of linear equations

    … the errors made on one-, two-, and multi-step linear equations in one variable with integral coefficients and solutions. The study occurred in five phases: (1) textbook analysis for scope of concepts and sequence of equations; (2) error-categorization scheme development based on previous …

    ubc Repository record for Identification of students' errors made in the solution of linear equations (opens in a new tab) Download PDF for Identification of students' errors made in the solution of linear equations (opens in a new tab)

  8. The satisfiability threshold of random linear equations over finite commutative rings

    In this thesis we study systems of random linear equations as a random constraint satisfaction problem (CSP). Determining the satisfiability threshold is one of the most fundamental problems in the study of any random CSP: how many constraints can a typical CSP have before it can no longer be …

    waterloo Repository record for The satisfiability threshold of random linear equations over finite commutative rings (opens in a new tab)

  9. Using Alternating Treatment Design To Determine Math Interventions For Linear Equations

    … feedback, with six students working on linear equations. Three participants were performing instructional level and four at frustration level. After a curriculum based assessment and baseline, an alternating treatment design examined the effectiveness of each intervention across …

    eiu Repository record for Using Alternating Treatment Design To Determine Math Interventions For Linear Equations (opens in a new tab)

  10. Krylov methods for solving a sequence of large systems of linear equations.

    Consider solving a sequence of linear systems A_{(i)}x^{(i)}=b^{(i)}, i=1, 2, ... where A₍ᵢ₎ ϵℂⁿᵡⁿ and b⁽ⁱ⁾ϵℂⁿ using some variations of Krylov subspace methods, like GMRES. For a single system Ax=b, it is well-known that the eigenvectors of the coefficient matrix A can be used to speed up the …

    baylor Repository record for Krylov methods for solving a sequence of large systems of linear equations. (opens in a new tab)

  11. Hands-on equations program: An approach to teaching linear equations using manipulatives

    … a mathematics program called Hands-On Equations (HOE), which is designed to help students learn abstract concepts taught in algebra with less difficulty. The program concentrates on the transition from numerical calculation to abstract reasoning by utilizing manipulatives. The objective …

    u-pacific Repository record for Hands-on equations program: An approach to teaching linear equations using manipulatives (opens in a new tab)

  12. Image representation and compression via sparse solutions of systems of linear equations

    … in finding sparse solutions to systems of linear equations $mathbf{A}mathbf{x} = mathbf{b}$, where $mathbf{A}$ is underdetermined and fully-ranked. In this thesis we examine an implementation of the {em orthogonal matching pursuit} (OMP) algorithm, an algorithm to find sparse solutions to …

    maryland Repository record for Image representation and compression via sparse solutions of systems of linear equations (opens in a new tab)

  13. Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations

    … in the network, and solving a system of linear equations whose data are scattered across the network or discovering that no solution exists. The ability to perform these tasks enhances the capability of existing and emerging networks such as smart power grids, social networks, and ad hoc …

    oklahoma-thes Repository record for Distributed Computation of Graph Spectrum, Eigenvector Centrality, and Solution to Linear Equations (opens in a new tab)

  14. ASSESSING STUDENT UNDERSTANDING WHILE SOLVING LINEAR EQUATIONS USING FLOWCHARTS AND ALGEBRAIC METHODS

    Solving linear equations has often been taught procedurally by performing inverse operations until the variable in question is isolated. Students do not remember which operation to undo first because they often memorize operations with no understanding of the underlying meanings. The study was …

    csusb Repository record for ASSESSING STUDENT UNDERSTANDING WHILE SOLVING LINEAR EQUATIONS USING FLOWCHARTS AND ALGEBRAIC METHODS (opens in a new tab)

Page 1 of 33