• Home
  • Documents
    • Graph Algorithms
    • Matrix Algorithms
    • Transformer Modeling
    • Transmission Line Modeling
    • Document Archive
      • Linux Mail Server Implementation
      • Viewing Mathematics on the Internet
      • Vismor Site Maintenance
      • Updating Kernel Modules
      • Updating the Nvidia Driver
      • West African Ebola Outbreak
  • Rt 28 Traffic Cameras
  • Maps of Antiquity
    • Historical Atlas
    • Atlas of Ancient and Classical Geography
  • Miscellaneous
    • Latitude/Longitude Lookup
    • Fox Chapel Landmarks
    • Code Repositories
  • Downloads
  • About
  • Search
Matrix Algorithms6.3 Additional Considerations7.1 LDU Decomposition of Symmetric Matrices

7 Symmetric Matrices

Recall that an n × n symmetric matrix A is its own transpose

$$\mathbf{A={A}^{T}}$$

This being the case, the elements of A are described by the following relationship

$$a_{ij}=a_{ji},\mbox{ for all }i,j$$ (73)
Symmetric Matrix Topics
  • 7.1 LDU Decomposition of Symmetric Matrices
  • 7.2 LU Decomposition of Symmetric Matrices
  • 7.3 Symmetric Matrix Data Structures
  • 7.4 Doolittle’s Method for Symmetric Matrices
  • 7.5 Crout’s Method for Symmetric Matrices
  • 7.6 Forward Substitution for Symmetric Systems
  • 7.7 Backward Substitution for Symmetric Systems
  • 7.8 Symmetric Factor Update

Copyright © 2004–2025 Vismor. All rights reserved.
Revised: Fri, 10 Jul 2020

Terms of Use         Privacy Policy