The repeated assembly of the sparse Jacobian matrix constitutes a primary computational bottleneck in the Newton-Raphson power-flow analysis. Through an algebraic operator equivariance analysis of the Jacobian matrix, this paper formalizes the reduction process and proposes a direct sparse Jacobian assembly method based on symbolic permutation. By pre-applying the permutation to the admittance matrix during a fast one-time symbolic phase via its sparse prefix-sum property, the runtime bus-type projection overhead and indirect mapping caches are entirely eliminated. Consequently, complex Jacobian differentiation and global matrix assembly fuse into a single operation, yielding a single-pass, branchless algorithm that streams values directly into contiguous memory. The proposed algorithm is implemented in the open-source RustPower solver. Benchmarks on IEEE test systems and PEGASE 9241 demonstrate that the proposed assembly is 28.1-37.9 times faster than the MATPOWER-style baseline and 8.9-9.7 times faster than the in-house Schäfer-Braun-inspired assembly (V1); on PEGASE 9241, it outperforms optimized traditional C++ assembly routines by 3.72 times in cold construction and 2.59 times across iterations. End-to-end, the iteration-loop solve time with KLU is 1.16-1.97 times faster than the native C++ LightSim2Grid and up to 95.5 times faster than pandapower, while leaving numerical results and convergence behavior unchanged. The method extends directly to general problems where a sparse Jacobian inherits its structure from a static network operator, including transient stability analysis, EMT simulation, and OPF Hessian assembly.
Levenberg-Marquardt power flow (LMPF) addresses ill-conditioned equations and provides least-squares stationary points for infeasible operating requests. Conventional implementations form damped normal equations, where J^T J introduces fill, squares the spectral condition number of the undamped part, and adds sparse-product cost. We propose an augmented LMPF formulation with a symbolic-permutation-based Jacobian operator that fills the augmented blocks directly. We prove that the matrix is symmetric quasi-definite for positive damping, enabling fixed-order, pivot-free QDLDL factorization. This property also motivates the solver choice: KLU value-only refactorization can reuse an unsuitable pivot order, forcing fresh full factorizations on difficult LMPF trajectories. We further introduce one-probe adaptive trust-region initialization for the radius and damping. Direct assembly is 7.5-11.9x faster than the fastest coordinate-list path and 18.0-58.8x faster than cached normal-equation sparse-product formation; QDLDL reduces numerical refactorization and triangular-solve time by up to 3.40x on identical matrices. Adaptive initialization solves flat-started RTE cases in 19-25 factorizations, 7.5-11.6x faster than reproduced three-step LM. On case2383wp, our 84-iteration run performs 84 factorizations and 168 resolves in 237 ms, versus published times of 200.780-441.72 s with fewer outer iterations, corresponding to speedups of 847-1860x. These results require complete factorization and resolve accounting and reveal initialization and legacy-parameter effects. DC-initialized NR exhibits fast quadratic convergence throughout every tested solvable loading range, motivating clearer, reproducible definitions of ill-conditioned power-flow benchmarks.