betaFeedback

WorksPhysics and Astronomy

Low-Rank Iteration for Efficient Calculations of Topological Surface States

Abstract

Surface states are hallmarks of topological phases, and their efficient computation is crucial for topology characterization. Conventional supercell methods (SCM) approximate semi-infinite systems as finite periodic ones, but suffer from high computational cost, artificial inter-surface coupling, and slow convergence near band edges. Recently, boundary problems for semi-infinite systems have been recast as block-tridiagonal equations and solved by the cyclic reduction method (CRM) and the transfer matrix method (TMM). However, these approaches remain resource-intensive, as fine-mesh discretization produces very large matrices. Recognizing the intrinsic sparsity and low rank of these matrices, we develop a low-rank iterative method (LIM) with stochastic trace estimation that substantially reduces complexity and memory without sacrificing accuracy, while remaining straightforwardly parallelizable. Benchmarks on 2D and 3D topological systems show orders-of-magnitude acceleration over CRM and TMM. LIM extends readily to heterostructures, defective interfaces, and non-Hermitian systems, providing an efficient platform for topological and plasmonic surface phenomena.

main_LIM-SDOS_NCS

*Correspondence: [email protected] (L.Z.) and [email protected] (S.M.)

Introduction

Artificially engineered materials, including photonic crystals, phononic crystals, and metamaterials, provide versatile platforms for exploring topological physics[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]. As a central feature, topologically protected surface states enable robust wave transport in devices such as low-loss waveguides and unidirectional components[11, 12, 13], and their dispersion and propagation determine key device metrics including operational bandwidth and group velocity[14, 15, 16]. Efficient, accurate determination of the surface-state spectrum at a single boundary is therefore crucial for both topological physics and device engineering.

A common approach is the supercell method (SCM), which treats a semi-infinite system as a finite periodic slab and solves its eigenvalue problem for the surface-state dispersion. Suppressing coupling between the two artificial surfaces requires a thick supercell, incurring substantial cost, particularly for finely discretized 3D structures. However, the decay length diverges near band edges, so residual coupling persists at any thickness. Moreover, surface states constitute only a small fraction of the computed bands, embedded among numerous bulk states, so identifying them is nontrivial[17]. A more direct route is the surface Green’s function of a partially infinite system[18, 19, 20, 21, 22, 23], whose trace defines the surface density of states (SDOS) and links surface states to surface-source excitation spectra. For electronic systems, iterative[24, 25, 26], recursive[27, 28], and transfer-matrix[29, 30, 31, 32] methods compute the local SDOS directly on the block-tridiagonal Toeplitz matrices of tight-binding models, without assembling the full infinite matrix. In contrast, photonic and phononic systems generally exhibit more complex geometries and materials, and require finite-element discretization, producing far more degrees of freedom (DOF) than their electronic counterparts[33, 34, 35, 36]. Finite-element block-diagonal formulations recently extended the cyclic-reduction method (CRM) and transfer-matrix method (TMM) to such systems[37, 38]. Nevertheless, both costs grow as a power law in the DOFs per unit cell, posing a bottleneck for high-dimensional, finely discretized systems. Thus, applying mature electronic schemes directly to photonic and phononic systems is often prohibitive.

Here, recognizing that the discretization matrices are intrinsically sparse and that the inter-cell coupling matrices are low-rank, we propose a low-rank iterative method (LIM) that overcomes the main cost sources of CRM and TMM for complex photonic and phononic systems (see Figure 1). For a uniformly discretized unit cell with NN DOFs, the rank rr of the coupling matrix scales roughly as N1/2N^{1/2} and N2/3N^{2/3} in 2D and 3D, far smaller than NN. LIM reformulates the surface Green’s function as an iteration of a low-rank Riccati equation restricted to a subspace set by rr, avoiding operations on full N×NN \times N matrices. The SDOS is then evaluated with Hutchinson’s stochastic trace estimator, without explicitly forming the dense Green’s function. These low-rank features substantially improve efficiency, enabling mildly super-linear scaling with finite-element DOFs. LIM also applies to systems formed by connecting multiple semi-infinite regions. We demonstrate this on bare and coated crystals, heterojunctions, sandwich structures, and 3D Weyl metamaterials, computing the SDOS and, where applicable, iso-frequency surfaces. Across these geometries, LIM resolves single-interface topological response, eliminates the mixing of opposite-surface states inherent to the SCM, and reduces memory and computation time. It extends directly to non-Hermitian systems, higher-order corner states, and inhomogeneous interfaces, thus offering an efficient, robust tool for topological device design.

Schematic of the Low-Rank Iterative Method

Figure 1. The Low-Rank Iterative Method. (a) Schematic of a representable semi-infinity array structure. (b) Each cell is represented by a sparse block matrix A\mathbf{A} coupled by low-rank sparse coupling matrices B\mathbf{B} and C\mathbf{C} in FEM, with blocks of the Green's function satisfying Gn+1=SGn\mathbf{G}_{n+1} = \mathbf{S}\mathbf{G}_n. (c) Schematic of low-rank QR factorization in LIM. The low-rank nature of C\mathbf{C} ensures that the QR decomposition yields UC\mathbf{U}_{C} and VC\mathbf{V}_{C} containing only a finite number rCr_{C} of orthonormal bases, thereby reducing the complexity of the iteration.

Results

Surface Green’s Function and Density of States

In the frequency domain, the source-free Maxwell equations yield an eigenvalue equation for the electric field E⃗\vec{E}, as does the fluid phononic wave equation for the acoustic pressure pp. Despite their distinct physical origins, both share a unified generalized-eigenvalue form with ω2\omega^2 as the eigenvalue. The Green’s functions G(ω;r,r′)\mathbf{G}(\omega;\mathbf{r},\mathbf{r}') of the photonic Eq. (1) and phononic Eq. (2) systems are the responses of the corresponding wave operators to point-source excitations δ(r−r′)\delta(\mathbf{r}-\mathbf{r}')[38]:

[∇×μ−1(r)⋅∇×−ω2ϵ(r)]⏟M(ω;r)G(ω;r,r′)=Iδ(r−r′)(1)\underbrace{\left[\nabla\times\mu^{-1}(\mathbf{r}) \cdot\nabla\times- \omega^2 \epsilon(\mathbf{r})\right]}_{M(\omega;\mathbf{r})}\mathbf{G}(\omega;\mathbf{r},\mathbf{r}')=\mathbf{I}\delta(\mathbf{r}-\mathbf{r}') \tag*{(1)}
[∇⋅ρ−1(r)⋅∇+ω2K−1(r)]⏟M(ω;r)G(ω;r,r′)=δ(r−r′)(2)\underbrace{\left[\nabla\cdot\rho^{-1}(\mathbf{r}) \cdot\nabla+ \omega^2 K^{-1}(\mathbf{r})\right]}_{M(\omega;\mathbf{r})}G(\omega;\mathbf{r},\mathbf{r}')=\delta(\mathbf{r}-\mathbf{r}') \tag*{(2)}

where μ\mu, ε\varepsilon, ρ\rho, and KK denote the permeability, permittivity, mass density, and bulk modulus at position r\mathbf{r}. Denoting the differential operator and material terms by M\mathbf{M}, both equations share the same form: M⋅G=I\mathbf{M}\cdot\mathbf{G}=\mathbf{I}. Physically, by introducing a small positive imaginary component i⋅ηi\cdot\eta into ω\omega, the imaginary part of the Green’s function G(ω;r,r′)\mathbf{G}(\omega;\mathbf{r},\mathbf{r}') reflects the response intensity to an excitation at r′\mathbf{r}'. Topological systems exhibit distinctive boundary properties, for which the SDOS spectral distribution is the key quantity. The SDOS follows from the surface Green’s function G0(ω;r,r′)\mathbf{G}_0(\omega;\mathbf{r},\mathbf{r}') for a surface excitation:

SDOS⁡(ω;r)=2ωπ⋅Im⁡[tr⁡(Q(r)⋅lim⁡η→0+G0(ω+iη;r,r′))](3)\operatorname{SDOS}(\omega;\mathbf{r})=\frac{2\omega}{\pi}\cdot\operatorname{Im}\left[\operatorname{tr}\left(\mathbf{Q}(\mathbf{r})\cdot\lim_{\eta\to0^+}\mathbf{G}_0(\omega+i\eta;\mathbf{r},\mathbf{r}')\right)\right] \tag*{(3)}

Here, Q\mathbf{Q} denotes the metric term, which is ε(r⃗)\boldsymbol{\varepsilon}(\vec{\mathbf{r}}) for photonic systems and K−1(r⃗)\mathbf{K}^{-1}(\vec{\mathbf{r}}) for phononic systems.

The topological systems studied are periodic or quasiperiodic normal to the interface and semi-infinite along it, with identical bulk parameters and translationally invariant inter-cell coupling (see Figure 1a-Figure 1b). Eqs. (1) and (2) then take the same block-tridiagonal Toeplitz form after finite-element discretization:

(ABCABCAB⋱⋱⋱CA)⏟M(ω;r)(G0G1G2⋮)=(I000⋮)(4)\underbrace{\begin{pmatrix} \mathbf{A} & \mathbf{B} & & & \\ \mathbf{C} & \mathbf{A} & \mathbf{B} & & \\ & \mathbf{C} & \mathbf{A} & \mathbf{B} & \\ & & \ddots& \ddots& \ddots\\ & & & \mathbf{C} & \mathbf{A} \end{pmatrix}}_{\mathbf{M}(\omega;\mathbf{r})} \begin{pmatrix} \mathbf{G}_0\\ \mathbf{G}_1\\ \mathbf{G}_2\\ \vdots \end{pmatrix} = \begin{pmatrix} \mathbf{I}_0\\ \mathbf{0}\\ \mathbf{0}\\ \vdots \end{pmatrix} \tag*{(4)}

Here, the diagonal blocks A\mathbf{A} describe intra-cell coupling, and the off-diagonal blocks B\mathbf{B} and C\mathbf{C} represent inter-cell coupling. All blocks are of size N×NN\times N for a unit cell discretized with NN DOFs and encode the geometry, materials, and periodicity information. The imaginary part of the trace of G0\mathbf{G}_0 yields the SDOS for the boundary excitation [I0,0,0,…]T[\mathbf{I}_0,0,0,\ldots]^{\mathsf{T}}. Note that I0\mathbf{I}_0 can be any boundary excitation, not necessarily constant, to target a specific surface mode, e.g., one with a given polarization.

Boundary modes are conventionally obtained by truncating the semi-infinite M\mathbf{M} to a finite number of cells in the SCM and diagonalizing the resulting finite matrix, which exploits only the sparsity of M\mathbf{M} and tolerates cell-to-cell differences. Instead, CRM and TMM compute G0\mathbf{G}_0 directly for a truly infinite system[37, 38]. CRM iteratively evaluates G0\mathbf{G}_0 approximately by eliminating odd-layer Green’s functions via Gaussian elimination until the effective inter-layer coupling decays exponentially. By contrast, TMM relates adjacent-layer Green’s functions via a transfer matrix and, keeping only decaying eigenmodes, reduces the problem to a linear relation between surface and bulk Green’s functions that yields G0\mathbf{G}_0 exactly. However, both approaches suffer from computational drawbacks that limit their efficiency: CRM destroys sparsity and iterates on dense matrices of order NN, whereas TMM obtains the transfer matrix in one step but expands the problem to order 2N2N, making TMM slower.

Low-Rank Iterative Method and Stochastic Trace Estimation

As an illustration, we study a bare semi-infinite 2D photonic crystal: a square-lattice gyromagnetic crystal terminated at the top by a perfect electric conductor (PEC) boundary (see Figure 2a). The gyromagnetic term breaks time-reversal symmetry, yielding a Chern insulator with a nontrivial Chern number that guarantees unidirectional boundary states[39]. The unit cell is discretized as in Figure 2b. The governing equation is cast into matrix form M\mathbf{M}, with nodal positions identifying the block rows and columns corresponding to A\mathbf{A}, B\mathbf{B}, and C\mathbf{C} in Eq. (4). Once the FEM preprocessing is complete, LIM is applied to calculate the SDOS.

SDOS on a Semi-infinite Photonic Crystal

Figure 2. SDOS on a Semi-infinite Photonic Crystal. (a) Schematic of the semi-infinite photonic crystal with a PEC boundary at the top. (b) Discretized unit cell mesh by FEM, where nodes inside the unit cell and those shared between unit cells (highlighted in orange) contribute to the intra-cell and inter-cell terms, corresponding to the block matrix AA and the coupling matrices BB and CC in Figure 1b, respectively. (c) Band structure of a 9-cell supercell obtained by SCM, with surface states located near the upper and lower PEC boundaries highlighted in orange and blue, respectively. (d-f) SDOS calculated by CRM, TMM, and LIM, respectively. (g) The distribution of the eigenstate obtained by SCM and of the Green’s function solved by LIM, respectively.

Mathematically, solving for the Green’s function vector G\mathbf{G} amounts to inverting the infinite block-tridiagonal Toeplitz matrix M\mathbf{M}:

(G0G1G2⋮)=G=M−1⋅I=Z⋅I=(Z00Z01Z02⋯Z10Z11Z12⋱Z20Z21Z22⋱⋮⋮⋮⋱)(I0000)(5)\begin{pmatrix} \mathbf{G}_0 \\ \mathbf{G}_1 \\ \mathbf{G}_2 \\ \vdots \end{pmatrix} = \mathbf{G} = \mathbf{M}^{-1}\cdot\mathbf{I} = \mathbf{Z}\cdot\mathbf{I} = \begin{pmatrix} \mathbf{Z}_{00} & \mathbf{Z}_{01} & \mathbf{Z}_{02} & \cdots\\ \mathbf{Z}_{10} & \mathbf{Z}_{11} & \mathbf{Z}_{12} & \ddots\\ \mathbf{Z}_{20} & \mathbf{Z}_{21} & \mathbf{Z}_{22} & \ddots\\ \vdots& \vdots& \vdots& \ddots \end{pmatrix} \begin{pmatrix} \mathbf{I}_0 \\ 0 \\ 0 \\ 0 \tag*{(5)} \end{pmatrix}

Here, Z=M−1\mathbf{Z}=\mathbf{M}^{-1} and G0=Z00\mathbf{G}_0=\mathbf{Z}_{00}. The SDOS requires neither the full Z\mathbf{Z} matrix nor Z00\mathbf{Z}_{00} itself, but only its trace. By translational invariance, the Green’s function blocks satisfy Gn+1=S⋅Gn\mathbf{G}_{n+1}=\mathbf{S}\cdot\mathbf{G}_n, where S\mathbf{S} is the transfer matrix. With ρ(S)\rho(\mathbf{S}) the spectral radius of S\mathbf{S}, i.e., the largest eigenvalue modulus[31], the condition ρ(S)<1\rho(\mathbf{S})<1 holds in the bandgap, thereby guaranteeing decay away from the boundary[38]. Thus, the transfer matrix S\mathbf{S} is exactly the stabilizing solution of the block Riccati equation:

BS2+AS+C=0(6)\mathbf{B}\mathbf{S}^{2}+\mathbf{A}\mathbf{S}+\mathbf{C}=0 \tag*{(6)}

Given A⋅G0+B⋅G1=I0\mathbf{A}\cdot\mathbf{G}_{0}+\mathbf{B}\cdot\mathbf{G}_{1}=\mathbf{I}_{0}, the surface Green’s function satisfies:

G0=Z00=(A+BS)−1(7)\mathbf{G}_{0}=\mathbf{Z}_{00}=(\mathbf{A}+\mathbf{B}\mathbf{S})^{-1} \tag*{(7)}

Mathematically, the SDOS amounts rigorously to solving the Riccati equation rather than inverting M\mathbf{M}. This formulation is fully equivalent to the TMM solution[29, 30, 31, 32, 38]. TMM linearizes the quadratic Riccati equation with auxiliary variables, converting it into a linear eigenvalue problem, but this doubles the eigenvalue-matrix dimension and raises the sparse-inversion cost to O((2N)3)\mathcal{O}((2N)^{3}), thereby substantially reducing efficiency.

To improve efficiency, LIM exploits the low-rank and sparse structure of the finite-element blocks, using a low-rank factorization with an iterative scheme to solve the Riccati equation. In finite-element discretization, the coupling matrices B\mathbf{B} and C\mathbf{C} between adjacent cells are set by the mesh connectivity, specifically by the interface DOFs marked orange in Figure 2b. For nBCn_{\mathrm{BC}} shared DOFs, the coupling matrices involve only these DOFs, so their ranks are bounded by nBCn_{\mathrm{BC}}: rB,rC≪nBCr_{B},r_{C}\ll n_{\mathrm{BC}}. For a Hermitian system B≈C†\mathbf{B}\approx\mathbf{C}^{\dagger}, the deviation arises only from the small imaginary part iηi\eta added to ω\omega for SDOS calculations, hence rB=rC=rr_{B}=r_{C}=r. For the structure in Figure 2b with N=166N=166, the ranks are only r=8r=8, far smaller than NN. We factorize the coupling matrices through low-rank sparse QR decompositions:

X=UXVX†,X∈{B,C}(8)\mathbf{X}=\mathbf{U}_{X}\mathbf{V}_{X}^{\dagger},\quad\mathbf{X}\in\{\mathbf{B},\mathbf{C}\} \tag*{(8)}

where UX,VX∈CN×rXU_X, V_X \in\mathbb{C}^{N \times r_X}, with rX≪Nr_X \ll N. The columns of UXU_X form orthonormal bases satisfying UX∗UX=IU_X^*U_X=I, and VXV_X satisfies VX=X†UXV_X=X^\dagger U_X (see Figure 1c).

Since the stable solution SS of the Riccati equation describes the exponentially decaying transfer driven by CC, its column space lies in the right singular subspace of CC. Physically, SS is governed by only a few interface-related modes, reducing SS to a lower-dimensional auxiliary factor L~\tilde{L}: S=LVC†∈CN×NS=LV_C^\dagger\in\mathbb{C}^{N\times N}, where L∈CN×rCL\in\mathbb{C}^{N\times r_C} contains the interface-related components and L~=VB†L∈CrB×rC\tilde{L}=V_B^\dagger L\in\mathbb{C}^{r_B\times r_C} is the projected auxiliary factor. Accordingly, L~\tilde{L} satisfies the self-consistent equation:

L~=F(L~)=−(VB†A−1UC)+(VB†A−1UB)⋅[I+L~⋅(VC†A−1UB)]−1⋅L~⋅(VC†A−1UC)(9)\tilde{L}=\mathcal{F}(\tilde{L})=-(V_B^\dagger A^{-1}U_C)+(V_B^\dagger A^{-1}U_B)\cdot\left[I+\tilde{L}\cdot(V_C^\dagger A^{-1}U_B)\right]^{-1}\cdot\tilde{L}\cdot(V_C^\dagger A^{-1}U_C) \tag*{(9)}

All SDOS and field-distribution calculations depend only on the low-rank factor L~\tilde{L} (derivation in Supplementary Section I). Setting L~0=0\tilde{L}^0=0, the self-consistent equation is solved by the iteration:

L~k+1=F(L~k)=−VBAC+VBAB⋅(I+L~k⋅VCAB)−1⋅L~k⋅VCAC(10)\tilde{L}^{k+1}=\mathcal{F}(\tilde{L}^k)=-V_{BAC}+V_{BAB}\cdot\left(I+\tilde{L}^k\cdot V_{CAB}\right)^{-1}\cdot\tilde{L}^k\cdot V_{CAC} \tag*{(10)}

where AUX=A−1UX∈CN×rXA_{U_X}=A^{-1}U_X\in\mathbb{C}^{N\times r_X} and V~X~AX=VX~†AUX∈CrX~×rX\tilde{V}_{\tilde{X}AX}=V_{\tilde{X}}^\dagger A_{U_X}\in\mathbb{C}^{r_{\tilde{X}}\times r_X} are constant matrices that can be precomputed. For a topological system, the iteration converges to a unique stabilizing solution and terminates when ∥L~k+1−L~k∥/∥L~k∥<τ\lVert\tilde{L}^{k+1}-\tilde{L}^k\rVert/\lVert\tilde{L}^k\rVert<\tau for a prescribed tolerance τ\tau. During the iteration, all operators are restricted to subspaces of dimension rBr_B and rCr_C, avoiding explicit manipulation of N×NN\times N dense matrices, which is the key to the mildly super-linear scaling of LIM.

Once L~\tilde{L} is determined, the surface Green’s function G0G_0 can be explicitly derived from Eq. (7) using the Sherman–Morrison–Woodbury formula[40, 41]:

G0=G(L~)=A−1−AUB⋅[I+L~⋅VCAB]−1⋅L~⋅VC†⋅A−1(11)G_0=\mathcal{G}(\tilde{L})=A^{-1}-A_{U_B}\cdot\left[I+\tilde{L}\cdot V_{CAB}\right]^{-1}\cdot\tilde{L}\cdot V_C^\dagger\cdot A^{-1} \tag*{(11)}

Compared with the single-layer solution A−1\mathbf{A}^{-1}, the second term acts as a correction accounting for the semi-infinite extension. Left-multiplying by Q\mathbf{Q} and taking the imaginary part of its trace directly yields the SDOS. The poles are fully governed by G0\mathbf{G}_0, while Q\mathbf{Q} acts only as a location-dependent weight and does not affect dispersion spectra. Thus, Q\mathbf{Q} can be neglected when identifying boundary states, which is convenient when Q\mathbf{Q} is a local matrix difficult to extract. A comparison with and without Q\mathbf{Q} is given in Section II of the Supplementary Material.

A remaining challenge is computing G0\mathbf{G}_0 exactly, which requires inverting A\mathbf{A}. Although most matrices are already available from preceding iterations, A\mathbf{A} is an N×NN \times N sparse matrix, and explicitly forming its inverse generally destroys sparsity, with worst-case time and memory complexities of O(N3)\mathcal{O}(N^3) and O(N2)\mathcal{O}(N^2). Explicit inversion is therefore prohibitive for large sparse problems. To improve efficiency further, we adopt a Hutchinson stochastic trace estimator[42, 43] for fast approximation of the SDOS:

tr⁡(G0)=E[xTG0x]=1m∑i=1mxiTG0xi(12)\operatorname{tr}(\mathbf{G}_0) = \mathbb{E}\left[\mathbf{x}^{\mathsf{T}}\mathbf{G}_0\mathbf{x}\right] = \frac{1}{m}\sum_{i=1}^{m}\mathbf{x}_i^{\mathsf{T}}\mathbf{G}_0\mathbf{x}_i \tag*{(12)}

where xi\mathbf{x}_i are independent Rademacher random vectors satisfying E[xixiT]=I\mathbb{E}[\mathbf{x}_i\mathbf{x}_i^{\mathsf{T}}] = \mathbf{I}.

tr⁡(G0)\operatorname{tr}(\mathbf{G}_0) is approximated by averaging quadratic forms over mm random vectors (m≪Nm \ll N), instead of all NN diagonal entries, with statistical error decreasing as 1/m1/\sqrt{m}. This requires only the action of A−1\mathbf{A}^{-1} on mm random vectors: the product A−1xi\mathbf{A}^{-1}\mathbf{x}_i is obtained by solving Awi=xi\mathbf{A}\mathbf{w}_i = \mathbf{x}_i via sparse LU back-substitution. Because A\mathbf{A} is sparse, this back-substitution scales with the sparsity of its LU factors. The same mechanism computes A−1UX\mathbf{A}^{-1}\mathbf{U}_{X}. Since both mm and rXr_X are much lower than NN, these operations are far cheaper than forming A−1\mathbf{A}^{-1} explicitly. With typically m=50m = 50 evaluations, the SDOS spectral lines are reproduced with high fidelity.

We validate LIM against SCM, CRM, and TMM, as shown in Figure 2. For SCM, the spectrum of a semi-infinite photonic crystal is approximated by diagonalizing a 9-cell supercell with PEC boundaries at both ends. Surface states protected by the nontrivial Chern number emerge and localize at both boundaries, with the corresponding bands highlighted in orange (upper) and blue (lower) in Figure 2c. Meanwhile, Figure 2d–Figure 2f show the SDOS of an ideal semi-infinite system from CRM, TMM, and LIM, respectively, with LIM agreeing with both while being faster. The SDOS renders bulk states continuous but surface states discrete. A forward-propagating surface state crosses the gap, while the backward-propagating modes coexisting in SCM vanish, underscoring the advantage of the ideal single interface.

Beyond the spectrum, LIM also yields field information that maps onto experimentally accessible boundary excitation fields. Unlike the spectrum, which requires only the trace of G0\mathbf{G}_0, the field calculation requires the full G0\mathbf{G}_0 and the transfer matrix S\mathbf{S}. Both are explicit in terms of L~\widetilde{\mathbf{L}}. Once G0\mathbf{G}_0 is available, all Gn\mathbf{G}_n propagate layer by layer via Gn+1=S⋅Gn\mathbf{G}_{n+1} = \mathbf{S} \cdot\mathbf{G}_n, yielding the boundary-excited fields. Figure 2g compares the SCM eigenstate with the LIM Green’s function, showing excellent agreement and confirming field localization near the boundary.

Numerical Examples for Various Topological Systems

LIM is not restricted to 2D bare systems. For systems with cladding layers, heterojunctions, sandwich structures, or more complex 3D geometries, the mathematical structure is similar. The low-rank iteration solves the Riccati equation in each semi-infinite region in the same way. The interface coupling gives expressions for G0\mathbf{G}_0 analogous to Eq. (7), and the stochastic trace estimator then yields the SDOS efficiently. We further demonstrate LIM with five representative examples: Figure 3 summarizes the dispersions of four distinct 2D topological systems, and Figure 4 presents a 3D Weyl system with its dispersion and iso-frequency surfaces. The formulation procedure and pseudocode are in Section III of the Supplementary Material.

Topological Surface States in different systems

Figure 3. Topological Surface States in different systems. (a-c) Semi-infinite photonic Chern insulator coated with a dielectric plate and terminated by a PEC boundary: (a) schematic, (b) band structure of a supercell obtained by SCM, and (c) SDOS spectrum calculated by LIM, with the representative field distribution shown in (a). (d–f) Heterojunction formed by joining two semi-infinite valley Chern insulator photonic crystals. (g–i) Hexagonal-lattice photonic crystal containing a single defect layer. (j–l) Phononic topological insulator formed by splicing two semi-infinite crystals. Panels (d–l) follow the same layout as (a–c). In the SCM results, modes at the target interface are marked in orange, while those at the other boundaries are marked in blue.

SDOS on a Semi-infinite 3D Weyl Metamaterial

Figure 4. SDOS on a Semi-infinite 3D Weyl Metamaterial. (a) Schematic of the saddle-shaped metamaterial, which behaves as an ideal Weyl system, with PEC boundary conditions at both the top and the bottom. (b) Band structure of a 9-cell supercell obtained by the SCM. (c, d) SDOS spectra calculated by LIM, with PEC boundaries at the top and bottom, respectively. (e) Evolution of the surface Fermi arcs in the SDOS equifrequency contours on the top surface from 10 to 12 GHz.

The first 2D example is a coated Chern insulator, identical to Figure 2 except that a cladding layer is inserted between the upper interface and the PEC boundary, and every third cell along the boundary is enlarged to fold the Brillouin zone to one third of its size (see Figure 3a–Figure 3c). SCM bands for a 9-cell supercell and the LIM SDOS are shown in Figure 3b–Figure 3c. Bragg scattering complicates the bands and hinders mode selection in SCM. Nevertheless, the SDOS contains only clean single-interface topological states with positive group velocity, localized near the upper surface and matching the orange bands in Figure 3b.

The second 2D example is a heterojunction of two semi-infinite valley Chern insulator photonic crystals (see Figure 3d–Figure 3f). Opposite rod orientations give the two sides distinct valley Chern numbers, so valley boundary states propagate bidirectionally along the junction. Figure 3e–Figure 3f show SCM bands for a 19-cell supercell and the LIM SDOS. Two boundary bands with opposite group velocities appear within the valley gap, in excellent agreement with SCM.

The third 2D example is a hexagonal-lattice photonic crystal with a single defect layer, combining semi-infinite crystals and a sandwich layer (see Figure 3g–Figure 3i). Triangular air holes of varying size and orientation are etched in a dielectric slab. Unequal inclusion sizes in the upper and lower crystals break spatial symmetry and open a gap near the Dirac point, whereas equal-size inclusions in the middle layer restore the degeneracy locally, producing localized modes that propagate bidirectionally. SCM bands for a 19-cell supercell and the LIM SDOS are in Figure 3h–Figure 3i. The two agree well, and LIM confines the results to the single interface.

The last 2D example is a phononic topological insulator, formed by joining two semi-infinite hexagonal-lattice phononic crystals with different inclusion radii (see Figure 3j–Figure 3l). As in the photonic case, once the M\mathbf{M} matrix is obtained by FEM, the SDOS follows the same procedure. SCM surface bands for a 9-cell supercell and the LIM SDOS are shown in Figure 3k–Figure 3l. Two pseudospin modes with opposite group velocities form interface-state bands traversing and connecting the band gap, again in excellent agreement.

The preceding examples are 2D, with scalar fields discretized by Lagrange finite elements with node-based DOFs. The final example extends LIM to the SDOS and constant-frequency surfaces of a 3D semi-infinite Weyl metamaterial (Figure 4). In 3D problems with curl operators, Nédélec edge elements are used, with low-order DOFs defined by tangential integrals along mesh edges[44]. Despite these differences, LIM still exploits the sublinear rank of the interface-related matrices. The 3D ideal Weyl metamaterial[45] consists of chiral metallic elements, with a PEC-terminated surface. Figure 4b shows SCM surface bands for a 9-cell supercell, with top and bottom surface states in orange and blue. Figure 4c-Figure 4d show the LIM SDOS for the two interfaces, examined separately through the boundary conditions, in excellent agreement with SCM. Figure 4e shows the SDOS equifrequency contours on the top surface from 10 to 12 GHz: the mode projections of the two oppositely chiral Weyl points are always linked by Fermi-arc surface states, in excellent agreement with Weyl-topology predictions.

Computing Efficiency and Accuracy

This section assesses the efficiency and accuracy of LIM, which mainly consists of two steps: solving L~\widetilde{L} by low-rank iteration and evaluating tr⁡(G0)\operatorname{tr}(G_{0}) by a stochastic trace estimator.

We consider a Hermitian system with low-rank factors satisfying rB=rC=r≪Nr_{B}=r_{C}=r\ll N. The Riccati iteration for L~\widetilde{L} runs entirely in the low-rank subspace: each step involves only r×rr\times r matrices and costs O(kr3)\mathcal{O}(kr^{3}) for kk iterations. Since r≪Nr\ll N, the main computational cost arises from initialization and applications of A−1A^{-1}. The low-rank QR decompositions of BB and CC cost approximately O(Nr2)\mathcal{O}(Nr^{2}), while the A−1A^{-1}-related initialization comprises a sparse LU factorization with cost O(s)\mathcal{O}(s), where ss denotes the number of LU nonzeros. With optimal nested dissection, ss scale as O(Nlog⁡N)\mathcal{O}(N\log N) in 2D and O(N4/3)\mathcal{O}(N^{4/3}) in 3D[46, 47]. Thus, the precomputation of A−1UXA^{-1}U_{X} cost O(rs)\mathcal{O}(rs), and the low-rank projections of VX†A−1UXV_{X}^{\dagger}A^{-1}U_{X} cost O(Nr2)\mathcal{O}(Nr^{2}), totaling O(rs+Nr2)\mathcal{O}(rs+Nr^{2}) for initialization. The same A−1A^{-1}-related operations dominate stochastic trace estimation: each of the mm random vectors, typically m=50m = 50, requires computing wi=A−1xiw_i = A^{-1}x_i by sparse LU back-substitution costing O(s)O(s) plus O(Nr)O(Nr) matrix–vector products. Thus, the overall complexity is thus O[rs+Nr2+kr3+m⋅(s+Nr)]O[rs + Nr^2 + kr^3 + m \cdot(s + Nr)]. Because rr-dependent terms have lower power in NN and small pre-factors, the cost is dominated by sparse A−1A^{-1}-related operations, scaling as O[(r+m)⋅s]O[(r + m) \cdot s].

For concreteness, we measure the actual cost. For different DOFs, we compute the SDOS of the system in Figure 2a at 51 frequencies using LIM, LIM-invA, CRM, and TMM, recording peak memory and time. Here, LIM-invA solves L~\widetilde{L} by low-rank iteration and evaluates G0G_0 directly, without stochastic trace estimation. The comparison thus isolates the benefit of stochastic trace estimation over direct A−1A^{-1} computation. The gain has a clear structural origin (see Figure 5a,Figure 5b): the boundary DOFs nBCn_{BC}, the coupling rank rBr_B, and the nonzeros sis_i of AA and LAL_A all grow slowly with NN. Specifically, the rr-dependent terms O(Nr2)O(Nr^2) and O(kr3)O(kr^3) grow super-linearly with NN as r∼O(N0.56)r \sim O(N^{0.56}) in 2D, but their small pre-factors keep sparse A−1A^{-1} operations dominant. The bottleneck is thus the LU factors, which grow as s∼O(N1.27)s \sim O(N^{1.27}), only moderately steeper than the O(Nlog⁡N)O(N\log N) expected for optimal nested dissection. Consequently, the empirical memory and time complexities are only O(N1.17)O(N^{1.17}) and O(N1.25)O(N^{1.25}) (see Figure 5c,Figure 5d). By contrast, CRM scales as O(N2.03)O(N^{2.03}) in memory and O(N2.48)O(N^{2.48}) in time, whereas TMM requires O(N2.03)O(N^{2.03}) memory and O(N3.31)O(N^{3.31}) time. LIM is thus substantially more efficient for large-scale 2D systems.

Computing Efficiency and Accuracy of the LIM Algorithm

Figure 5. Computing Efficiency and Accuracy of the LIM Algorithm. (a, b) Number of the nBCn_{BC} and rBr_{B}, and of nonzero matrix elements sis_i of AA and LAL_A, in the 2D system, each fitted by a power function. (c, d) Average memory usage and computational time versus DOFs, obtained at 51 frequency points using LIM, LIM-invA, CRM, and TMM. For each algorithm, the growth rate with NN is fitted to a power law and marked to the right of the curve. (e) Error analysis of the stochastic trace estimator: RMSE versus the number of random vectors mm, decreasing as 1/m1/\sqrt{m}. Insets show the SDOS versus frequency at kx=−0.8π/ak_x=-0.8\pi/a for different mm, illustrating the accuracy of the calculation.

For 3D systems, the LU factorization suffers far more fill-in, so each application of A−1A^{-1} is more expensive and the gain of LIM is somewhat smaller than in 2D, though still substantial. A rigorous asymptotic analysis is not pursued because CRM and TMM become prohibitively costly. Instead, we benchmark a 3D structure with 4,643 DOFs, averaging over 20 independent runs at different frequencies (Table 1). Compared with CRM, LIM consumes about 1/17 of the memory and 1/15 of the time; relative to TMM, about 1/16 of the memory and only 1/184 of the time. LIM thus retains a clear 3D advantage, reducing both memory and time by more than one order of magnitude.

Target FunctionLIMLIM-invACRMTMM
Avg Time (s)2.597411.833438.1799478.5181
Time Ratio14.5614.7184.23
Workspace Memory (MB)130.1375582.04542214.28392032.0552
Workspace Memory Ratio14.4717.0115.61

Table 1. Computational cost comparison of the four target functions in a 3D semi-infinite Weyl system with DOFs 4643. Time and workspace memory ratios are normalized to the LIM baseline.

Finally, we remark on the accuracy of LIM. Indeed, Figure 2–Figure 4 already demonstrate remarkable accuracy despite high efficiency. Once the low-rank iteration converges, accuracy is fully determined by the prescribed tolerance τ\tau and can be regarded as numerically exact. For stochastic trace estimation, accuracy improves with the number of random vectors mm: as shown in Figure 5e, the root-mean-square error (RMSE) decreases as 1/m1/\sqrt{m} with increasing mm. The qualitative SDOS features are usually of primary interest, and m=50m = 50 already suffices for representative surface states. Increasing mm further reduces the statistical error, approaching explicit evaluation, but the cost grows approximately linearly with mm. A trade-off between accuracy and efficiency is therefore required.

Discussion

In summary, LIM efficiently computes the SDOS of semi-infinite topological photonic and phononic systems. Exploiting the low-rank and sparse structure of FEM discretization, it resolves the surface response by low-rank Riccati iteration and evaluates the SDOS by stochastic trace estimation without constructing large-scale matrices. Operating directly on the Green’s function, it avoids the boundary-coupling issues of SCM. LIM matches Green’s-function-based CRM and TMM in accuracy while substantially reducing memory and time, with advantages growing with DOFs and making it practical for large-scale topological systems.

Beyond photonic and phononic systems, LIM holds promise for electronic-structure calculations with localized bases such as numerical atomic orbitals (NAOs)[48] and maximally localized Wannier functions[49]. For complex structures that are challenging for conventional electronic-structure methods, such as large supercells and quasi-one-dimensional nanoribbons, the Hamiltonian retains the same sparse, low-rank block-tridiagonal form, so low-rank Riccati iteration could compute the embedding self-energies of semi-infinite leads without constructing the full device Hamiltonian, providing an efficient alternative to recursive Green’s function methods.

Methods

Simulation environment

All simulations reported in this work, both the numerical examples and the performance benchmarks, were carried out with COMSOL Multiphysics, controlled through a MATLAB scripting interface. COMSOL serves here primarily as a mesh generator; other open-source finite-element meshing packages could fulfill the same role. In a typical run, a supercell is constructed in COMSOL, and its finite-sized eigenmatrix M\mathbf{M} is exported to MATLAB. There, M\mathbf{M} is split into the diagonal self-coupling blocks A\mathbf{A} and the off-diagonal inter-coupling blocks B\mathbf{B} and C\mathbf{C}, which LIM, CRM, and TMM all act on. Since every method is applied to the same geometry and the same mesh, the performance metrics, including computational time, memory usage, and accuracy, are compared under strictly identical conditions, so the comparison is rigorous and free of bias. Timing and memory were measured on a personal computer with an Intel Core i7-13700 CPU (16 cores, 24 threads, 2.10 GHz).

Details of numerical examples

All structures were discretized with the finite-element method. The specific structural and material settings are provided in the simulation files archived in the open data repository[50].

The bare photonic crystal in Figure 2 is based on a square lattice with lattice constant aa, and its unit cell contains a cylindrical inclusion of radius 0.13a0.13a with relative permittivity εr=13\varepsilon_r = 13 and relative permeability μii=1\mu_{ii} = 1, μxy=−μyx=0.4i\mu_{xy} = -\mu_{yx} = 0.4i. This gyromagnetic response breaks time-reversal symmetry and yields the Chern-insulator phase. The coated crystal in Figure 3a–Figure 3c shares this geometry, except that an additional air layer of thickness d=0.5ad = 0.5a separates the upper interface from the PEC boundary. Along this boundary, every third boundary unit cell is slightly enlarged, with its inclusion radius raised to 0.2a0.2a, while the rest keep the original 0.13a0.13a. This enlargement folds the Brillouin zone to one third of its original size.

The valley-Chern heterojunction in Figure 3d–Figure 3f joins two semi-infinite photonic crystals of triangular dielectric rods with side length 0.615a0.615a, chamfer length 0.11a0.11a, relative permittivity εr=1\varepsilon_r = 1 and relative permeability μr=13\mu_r = 13. Opposite rod orientations give the two sides distinct valley Chern numbers. The defect-layer structure in Figure 3g–Figure 3i consists of a dielectric slab with relative permittivity εr=11.56\varepsilon_r = 11.56 and permeability μr=1\mu_r = 1, perforated by triangular air holes of side length 1.3a/31.3a/\sqrt{3} and 0.7a/30.7a/\sqrt{3} in the upper and lower crystals, respectively, with equal-size holes in the middle layer. The phononic crystal in Figure 3j–Figure 3l joins two hexagonal-lattice acoustic crystals whose cylindrical inclusions have radii 0.3a0.3a and 0.45a0.45a.

The 3D Weyl metamaterial in Figure 4 consists of saddle-shaped chiral metallic elements embedded in a PCB substrate with relative permittivity εr=2.2\varepsilon_r = 2.2, with in-plane periods ax=ay=3mma_x = a_y = 3mm and out-of-plane period az=6mma_z = 6mm. The element geometry is specified by dp=0.75mmd_p = 0.75mm, dm=1.6mmd_m = 1.6mm, tm=0.2mmt_m = 0.2mm and Rm=0.4mmR_m = 0.4mm. Both the top and bottom surfaces are terminated by PEC boundaries.

Acknowledgements

Funding: This work was supported by National Key Research and Development Program of China (Grants No. 2023YFA1407700, 2023YFA1406901, and 2022YFA1404700), the Key Program of the National Natural Science Foundation of China (No. 12634017), National Natural Science Foundation China (Grants No. 12374343, 12221004, 62192771), and the start-up funding of Fudan University (JIH1232098Y). We also thank Dr. Yixin Sha for helpful discussions.

Author contributions: S.M. conceived the initial concept, K.L., C.H., Z.X. and S.M. performed numerical simulations and analytical calculations, S.S., L.Z. and S.M. participated in the analysis of the results, and S.M. and L.Z. supervised the project.

Competing interests: The authors declare no conflict of interest.

Data and materials availability: All data and source code that support the findings of this study are openly available in the Science Data Bank[50] and via GitHub at https://github.com/KaiqiLiu-LKQ/Low-Rank-Iteration-Method-for-Topological-Surface-States.

Supplementary Materials:

Correspondence: [email protected] (L.Z.) and [email protected] (S.M.).

SI_LIM-SDOS_NCS

This file includes:

  1. Detailed Derivation of the LIM Algorithm

  1. Discussion of the Metric QQ in the SDOS calculation

  1. Pseudocode of the LIM for representative partially infinite systems

Detailed Derivation of the LIM Algorithm

Starting from the block Riccati equation given in Eq. (6) of the main text, we have:

S=−A−1C−A−1B⋅S2(13)S=-A^{-1}C-A^{-1}B\cdot S^2 \tag*{(13)}

To proceed, we exploit the low-rank structure of the coupling matrices BB and CC. Specifically, these matrices can be factorized as:

S=LVC†,B=UBVB†,C=UCVC†(14)S=LV_C^\dagger,\quad B=U_BV_B^\dagger,\quad C=U_CV_C^\dagger \tag*{(14)}

Substituting Eq. (14) into Eq. (13) and rearranging the resulting terms yields:

LVC†=−A−1UCVC†−A−1UBVB†(LVC†)2(15)LV_C^\dagger=-A^{-1}U_CV_C^\dagger-A^{-1}U_BV_B^\dagger\left(LV_C^\dagger\right)^2 \tag*{(15)}

Right-multiplying both sides of Eq. (15) by VCV_C, we obtain:

L⋅(VC†VC)=−A−1UC⋅(VC†VC)−A−1⋅UBVB†⋅LVC†L⋅(VC†VC)(16)L\cdot\left(V_C^\dagger V_C\right)=-A^{-1}U_C\cdot\left(V_C^\dagger V_C\right)-A^{-1}\cdot U_BV_B^\dagger\cdot LV_C^\dagger L\cdot\left(V_C^\dagger V_C\right) \tag*{(16)}

Here, the common factor VC†VCV_C^\dagger V_C is invertible and can therefore be eliminated completely, yielding:

L=−A−1UC−A−1UB⋅VB†L⋅VC†L(17)L=-A^{-1}U_C-A^{-1}U_B\cdot V_B^\dagger L\cdot V_C^\dagger L \tag*{(17)}

Next, left-multiplying Eq. (17) by VC†V_C^\dagger and extracting VC†LV_C^\dagger L, we arrive at:

[I+(VC†A−1UB)⋅VB†L]⋅VC†L=−(VC†A−1UC)(18)\left[I+\left(V_C^\dagger A^{-1}U_B\right)\cdot V_B^\dagger L\right]\cdot V_C^\dagger L=-\left(V_C^\dagger A^{-1}U_C\right) \tag*{(18)}

From this, we can get:

VC†L=−[I+(VC†A−1UB)⋅VB†L]−1⋅(VC†A−1UC)(19)V_C^\dagger L=-\left[I+\left(V_C^\dagger A^{-1}U_B\right)\cdot V_B^\dagger L\right]^{-1}\cdot\left(V_C^\dagger A^{-1}U_C\right) \tag*{(19)}

Reversing the steps from Eq. (19) back to Eq. (17) and rearranging the results, we arrive at:

L=−A−1UC+A−1UB⋅VB†L⋅[I+(VC†A−1UB)⋅VB†L]−1⋅(VC†A−1UC)(20)L=-A^{-1}U_C+A^{-1}U_B\cdot V_B^\dagger L\cdot\left[I+\left(V_C^\dagger A^{-1}U_B\right)\cdot V_B^\dagger L\right]^{-1}\cdot\left(V_C^\dagger A^{-1}U_C\right) \tag*{(20)}

By invoking the following matrix identity:

(I+PQ)−1⋅P=P⋅(I+QP)−1(21)\left(I+PQ\right)^{-1}\cdot P=P\cdot\left(I+QP\right)^{-1} \tag*{(21)}

With P=VB†LP=V_B^\dagger L and Q=VC†A−1UBQ=V_C^\dagger A^{-1}U_B, Eq. (20) can be recast into the following form:

L=−A−1UC+A−1UB⋅[I+(VB†L)⋅VC†A−1UB]−1⋅VB†L⋅(VC†A−1UC)(22)L=-A^{-1}U_C+A^{-1}U_B\cdot\left[I+\left(V_B^\dagger L\right)\cdot V_C^\dagger A^{-1}U_B\right]^{-1}\cdot V_B^\dagger L\cdot\left(V_C^\dagger A^{-1}U_C\right) \tag*{(22)}

Finally, by right-multiplying both sides of Eq. (22) by VB†V_B^\dagger, we obtain the self-consistent equation corresponding to Eq. (9) in the main text.

VB†L=−VB†A−1UC+VB†A−1UB⋅[I+(VB†L)⋅VC†A−1UB]−1⋅VB†L⋅(VC†A−1UC)(23)V_B^\dagger L=-V_B^\dagger A^{-1}U_C+V_B^\dagger A^{-1}U_B\cdot\left[I+(V_B^\dagger L)\cdot V_C^\dagger A^{-1}U_B\right]^{-1}\cdot V_B^\dagger L\cdot\left(V_C^\dagger A^{-1}U_C\right) \tag*{(23)}

In the computation, the following initialization matrices must be evaluated, along with the definition of L~\tilde{L}:

L~=VB†LAUB=A−1UB,AUC=A−1UCVBAB=VB†A−1UB=VB†AUB,VBAC=VB†A−1UC=VB†AUCVCAB=VC†A−1U=VC†AUB,VCAC=VB†A−1UC=VB†AUC(24)\begin{aligned} \tilde{L}&=V_B^\dagger L\\ A_{U_B}&=A^{-1}U_B,\quad A_{U_C}=A^{-1}U_C\\ V_{BAB}&=V_B^\dagger A^{-1}U_B=V_B^\dagger A_{U_B},\quad V_{BAC}=V_B^\dagger A^{-1}U_C=V_B^\dagger A_{U_C}\\ V_{CAB}&=V_C^\dagger A^{-1}U=V_C^\dagger A_{U_B},\quad V_{CAC}=V_B^\dagger A^{-1}U_C=V_B^\dagger A_{U_C} \tag*{(24)} \end{aligned}

Based on these definitions, the self-consistent equation for L~\tilde{L} can be written as:

L~=−VBAC+VBAB[I+L~⋅VCAB]−1⋅L~⋅VCAC(25)\tilde{L}=-V_{BAC}+V_{BAB}\left[I+\tilde{L}\cdot V_{CAB}\right]^{-1}\cdot\tilde{L}\cdot V_{CAC} \tag*{(25)}

This self-consistent equation can be solved iteratively, with the iteration performed entirely in the low-rank subspace.

To obtain the explicit expression for G0G_0 efficiently, we invoke the Sherman–Morrison–Woodbury (SMW) formula, which reads:

(A+UV†)−1=A−1−A−1U⋅(I+V†A−1U)−1⋅V†A−1(26)\left(A+UV^\dagger\right)^{-1}=A^{-1}-A^{-1}U\cdot\left(I+V^\dagger A^{-1}U\right)^{-1}\cdot V^\dagger A^{-1} \tag*{(26)}

The above form is valid provided that A∈CN×NA\in\mathbb{C}^{N\times N} and I+V†A−1UI+V^\dagger A^{-1}U are invertible, and that U,V∈CN×kU,V\in\mathbb{C}^{N\times k}. The formula can be verified directly by matrix multiplication.

Substituting into Eq. (8) of the main text and using the low-rank decomposition of the coupling matrices, we obtain:

G0=(A+BS)−1=(A+UB⋅VB†LVC†)−1=A−1−A−1UB⋅[I+VB†LVC†⋅A−1⋅UB]−1⋅VB†LVC†⋅A−1(27)\begin{aligned} G_0&=(A+BS)^{-1}\\ &=\left(A+U_B\cdot V_B^\dagger L V_C^\dagger\right)^{-1}\\ &=A^{-1}-A^{-1}U_B\cdot\left[I+V_B^\dagger L V_C^\dagger\cdot A^{-1}\cdot U_B\right]^{-1}\cdot V_B^\dagger L V_C^\dagger\cdot A^{-1} \tag*{(27)} \end{aligned}

Here, using the SMW formula, we define U=UBU=U_B and V=VBLVC†V=V_B L V_C^\dagger. Substituting the above definitions, we find that G0G_0 depends entirely on L~\tilde{L}:

G0=A−1−AUB⋅[I+L~⋅VCAB]−1⋅L~⋅VC†⋅A−1(28)G_0=A^{-1}-A_{U_B}\cdot\left[I+\tilde{L}\cdot V_{CAB}\right]^{-1}\cdot\tilde{L}\cdot V_C^\dagger\cdot A^{-1} \tag*{(28)}

Likewise, the transfer matrix SS can also be expressed in terms of L~\tilde{L} from Eq. (22):

S=LVC†=−AUC⋅VC†+AUB⋅[I+L~⋅VCAB]−1⋅L~⋅VCAC⋅VC†(29)\mathbf{S}=\mathbf{L}\mathbf{V}_{C}^{\dagger}=-\mathbf{A}_{U_C}\cdot\mathbf{V}_{C}^{\dagger}+\mathbf{A}_{U_B}\cdot\left[\mathbf{I}+\widetilde{\mathbf{L}}\cdot\mathbf{V}_{CAB}\right]^{-1}\cdot\widetilde{\mathbf{L}}\cdot\mathbf{V}_{CAC}\cdot\mathbf{V}_{C}^{\dagger} \tag*{(29)}

When the dispersion relation of the surface states is the only quantity of interest, the SDOS spectrum can be obtained by applying the stochastic trace estimator to Eq. (28). If, however, the field distribution associated with the surface excitation must be computed rigorously, the inverse of A\mathbf{A} must be evaluated exactly according to Eq. (28) to obtain G0\mathbf{G}_0, after which the transfer matrix S\mathbf{S} is obtained via Eq. (29). The Green's function field distribution of the entire system is then given rigorously by Gn=Sn⋅G0\mathbf{G}_n=\mathbf{S}^n\cdot\mathbf{G}_0.

Discussion of the Metric QQ in the SDOS calculation

Strictly speaking, the SDOS result is given by Eq. (3), which depends not only on the surface Green's-function matrix G0G_0 but also on the metric term Q(r)Q(\mathbf{r}). Once the metric is included, Eq. (11) of the main text can still be evaluated with the stochastic trace estimator, so the leading-order computational cost is unchanged. In practice, however, the metric itself can be rather complicated: in materials containing gyromagnetic terms, for example, Q(r)Q(\mathbf{r}) is a 3×33 \times3 tensor at every node, which complicates both its extraction and its application. In this work we therefore neglect Q(r)Q(\mathbf{r}) and directly use the imaginary part of the trace of G0G_0 to locate the modes. The metric-weighted and unweighted spectra are not equal in a strict mathematical sense.

The SDOS peaks, however, arise from the divergent response of the system at the mode frequencies under a given excitation, and the same divergence occurs at the mode frequencies for both G0\mathbf{G}_0 and Q⋅G0\mathbf{Q}\cdot\mathbf{G}_0. In electromagnetic systems, the two correspond respectively to the electric field and the electric displacement field, whose divergences likewise occur at the mode frequencies. Hence, provided that Q(r)\mathbf{Q}(\mathbf{r}) is non-singular, the metric affects only the excitation strength and does not shift the mode positions.

To assess the influence of omitting Q(r)\mathbf{Q}(\mathbf{r}), we calculated both the unweighted spectrum, Im⁡(trace⁡(G0))\operatorname{Im}(\operatorname{trace}(\mathbf{G}_0)), and the weighted spectrum, Im⁡(trace⁡(Q(r)G0))\operatorname{Im}(\operatorname{trace}(\mathbf{Q}(\mathbf{r})\mathbf{G}_0)), for the 2D photonic crystal shown in Figure 2 of the main text. As shown in Figure S1-Figure S1), both approaches clearly identify the same surface state dispersion. Furthermore, Figure S1 compares the two spectra over the frequency range ω=(0.6∼0.7)⋅a/2πc\omega=(0.6\sim0.7)\cdot a/2\pi c at kx=−0.8π/ak_x=-0.8\pi/a. Although the two approaches yield noticeably different absolute spectral intensities, their peak positions and overall line shapes are nearly identical, indicating the same surface mode positions. Therefore, omitting Q(r)\mathbf{Q}(\mathbf{r}) does not affect the identification of the surface state position or its distinction from the bulk states in the present system.

Comparison of the SDOS with and without the metric $Q$

Figure S1. Comparison of the SDOS with and without the metric QQ. (a) Simplified SDOS spectrum, with the formula Im⁡(trace⁡(G0))\operatorname{Im}(\operatorname{trace}(G_0)). (b) Rigorous SDOS spectrum, with the formula Im⁡(trace⁡(Q(r)G0))\operatorname{Im}(\operatorname{trace}(Q(\mathbf{r})G_0)). (c) Comparison of the SDOS with and without QQ at kx=−0.8π/ak_x=-0.8\pi/a. Both spectra are calculated by LIM for the photonic crystal shown in Figure 2 of the main text.

This insensitivity can be understood from the pole structure of the Green’s function: weighting the spectrum in post-processing changes the spectral weight of each mode without changing its resonance poles. Since the Green’s function diverges at a mode in the limit i⋅η→0i\cdot\eta\to0, the peak position is fixed by its pole alone. Provided that no material parameter diverges at the same frequency, neither the spatial inhomogeneity nor the frequency dispersion of Q(r)\mathbf{Q}(\mathbf{r}) can shift it. The two definitions therefore give the same peak positions and generally similar line shapes, while their absolute intensities may differ noticeably. An exception arises in extreme cases: at the resonance frequency of a lossless material, the material parameters, and hence the metric itself, can diverge, so that the dispersion requires additional care. For instance, the frequency-dependent terms can be linearized by introducing auxiliary variables, so that the response at that frequency can be evaluated correctly.

In summary, the analysis in this work focuses on the spectral positions and dispersions of the surface states, as well as their distinction from the bulk states, rather than on the absolute calibration of the SDOS. We also note that the peak intensity of the numerical spectrum depends on the artificially introduced imaginary component i⋅ηi \cdot\eta. Therefore, the spectral intensities in this work are primarily used for relative comparison and surface-state identification.

Pseudocode of the LIM for Representative Partially Infinite Systems

In this chapter, we present the pseudocode of the LIM for four types of partially infinite systems. These four cases cover most scenarios involving partially infinite systems, and the LIM for more complex systems can also be derived by reference to these cases.

LIM for a Bare Semi-Infinite Crystal

This section presents the LIM for a bare semi-infinite crystal, which corresponds to the system in Fig. 2 and Fig. 4 of the main text. The operator matrix M\mathbf{M} of this system can be expressed as:

M=(ABCABCAB⋱⋱⋱)(30)\mathbf{M} = \left( \begin{array}{c|cccc} A & B & & & \\ \hline C & A & B & & \\ & C & A & B & \\ & & \ddots& \ddots& \ddots \end{array} \right) \tag*{(30)}

A detailed discussion of this system is given in the main text.

The following is the detailed pseudo-code of the algorithm 1:

Algorithm 1: LIM for a bare semi-infinite crystal (Fig. 2 and Fig. 4 in the main text)

Initialization:

AA, BB, CC

maximum iterations >0> 0, error tolerance >0> 0, number of random vectors >0> 0

Output:

trZ00 (trace of Z00)

  1. // Step 1: Low-rank truncation of BB and CC using QR decomposition

  2. [QB,RB]=qr⁡(B)[Q_B,R_B] = \operatorname{qr}(B)

  3. [QC,RC]=qr⁡(C)[Q_C,R_C] = \operatorname{qr}(C)

  4. [UB,VB,UC,VC]=solveUV⁡(QB,RB,QC,RC)[U_B,V_B,U_C,V_C] = \operatorname{solveUV}(Q_B,R_B,Q_C,R_C)

  5. // Keep the columns UBU_B and UCU_C in QBQ_B and QCQ_C where the diagonal elements of RBR_B and RCR_C are non-zero, satisfying B=UBVB†,C=UCVC†B = U_B V_B^{\dagger}, C = U_C V_C^{\dagger}

  6. // Step 2: Precompute quantities independent of the iteration

7.    AinvUB = A⁻¹U_B
8.    AinvUC = A⁻¹U_C
9.    P = V_B† × AinvUC
10.   Q = V_B† × AinvUB

11.   R = V_C† × AinvUB
12.   T = V_C† × AinvUC
13.   // Step 3: Solve for the L̃ = V_B′L using low-rank Riccati iteration
14.   Lᵗ = 0
15.   for i = 1 to maximum iterations do:
16.       Lᵗnew = −P + Q × (I_{r_b} + Lᵗ × R)⁻¹ × (Lᵗ × T)
17.       if ‖Lᵗnew − Lᵗ‖_F/(‖Lᵗ‖_F + eps) < error tolerance then
18.           break
19.       end
20.       Lᵗ = Lᵗnew
21.   end
22.   // Step 4: Precompute fixed matrices for Woodbury formula
23.   VBLfinal = Lᵗ
24.   K = I_{r_b} + VBLfinal · R
25.   [LK, UK] = lu(K)
26.   // Step 5: Estimate tr((A + B S)⁻¹) using Hutchinson's method
27.   z = randomVector(m)
28.   // Generate m Rademacher random vectors
29.   w = A⁻¹z
30.   s = UK⁻¹(LK⁻¹ × VBLfinal × V_C†w)
31.   Z00z = w − AinvUB × s
32.   sumtr = sum(z† × Z00z)
33.   //Calculate each column's z_i† × Z00 × z_i
34.   trZ00 = sumtr/m
35.   return trZ00

Noted that the inverse matrix operator A−1A^{-1} here is used only to express the mathematical formula clearly. In the calculation, LU decomposition is employed to obtain the inverse matrix and its products A−1UBA^{-1}U_B, A−1UCA^{-1}U_C and A−1zA^{-1}z.

LIM for a Semi-Infinite Crystal with a Modified Boundary Block

This section presents the LIM for a semi-infinite crystal with a modified boundary block, which corresponds to the system in Figure 3(a) of the main text involving additional cladding layers. The operator matrix MM of this system can be expressed as:

M=(A0B0C0A1B1C1A1B1⋱⋱⋱)(31)M=\begin{pmatrix} A_0 & B_0 & & \\ C_0 & A_1 & B_1 & \\ & C_1 & A_1 & B_1 \\ & & \ddots& \ddots& \ddots \end{pmatrix} \tag*{(31)}

The difference from algorithm 1 lies in the additional treatment required for the coupling of surface Green’s functions.

In this modified semi-infinity system, obtaining the final response requires considering two distinct sets of Green's functions simultaneously: the bulk surface Green's function z11z_{11} and the boundary surface Green's function z00z_{00}. They are defined respectively as:

z11=(A1+B1S)−1,z00=(A0−B0z11C0)−1(32)z_{11}=(A_1+B_1S)^{-1},\quad z_{00}=(A_0-B_0z_{11}C_0)^{-1} \tag*{(32)}

Both Green's functions can be converted into explicit expressions via Woodbury transformations. The core expressions of the two Woodbury transformations are as follows:

z11=A1−1−A1−1UB1[I+L~VC1†A1−1UB1]−1L~VC1†A1−1(33)z_{11}=A_1^{-1}-A_1^{-1}U_{B_1}\left[I+\widetilde{L}V^{\dagger}_{C_1}A_1^{-1}U_{B_1}\right]^{-1}\widetilde{L}V^{\dagger}_{C_1}A_1^{-1} \tag*{(33)}

and

z00=A0−1+A0−1UB0[I−L~00VC0†A0−1UB0]−1L~00VC0†A0−1(34)z_{00}=A_0^{-1}+A_0^{-1}U_{B_0}\left[I-\widetilde{L}_{00}V^{\dagger}_{C_0}A_0^{-1}U_{B_0}\right]^{-1}\widetilde{L}_{00}V^{\dagger}_{C_0}A_0^{-1} \tag*{(34)}

where L~00=VB0†z11UC0\widetilde{L}_{00}=V^{\dagger}_{B_0}z_{11}U_{C_0}. The final SDOS can be expressed as a trace involving Z00Z_{00}, which can likewise be obtained using the stochastic trace estimator:

tr⁡(Z00)=1m∑i=1mzi†Z00zi(35)\operatorname{tr}(Z_{00})=\frac{1}{m}\sum_{i=1}^{m}z_i^{\dagger}Z_{00}z_i \tag*{(35)}

The following is the detailed pseudo-code of the algorithm 2:

Algorithm 2: LIM for a semi-infinite crystal with a boundary block (Fig. 3a in the main text)
Initialization:
A0, B0, C0, A1, B1, C1
maximum iterations > 0, error tolerance > 0, number of random vectors > 0
Output:
trZ00 (trace of Z00)
1. // Step 1: Low-rank truncation of B∗B^* and C∗C_* using QR decomposition
2. [QB0,RB0]=qr⁡(B0)[Q_{B_0},R_{B_0}]=\operatorname{qr}(B_0)
3. [QC0,RC0]=qr⁡(C0)[Q_{C_0},R_{C_0}]=\operatorname{qr}(C_0)

Table 2.

  1. [QB1,RB1]=qr⁡(B1)[Q_{B_1}, R_{B_1}] = \operatorname{qr}(B_1)

  1. [QC1,RC1]=qr⁡(C1)[Q_{C_1}, R_{C_1}] = \operatorname{qr}(C_1)

  1. [UB0,VB0,UC0,VC0,UB1,VB1,UC1,VC1]=solveUV⁡(QB0,RB0,QC0,RC0,QB1,RB1,QC1,RC1)[U_{B_0}, V_{B_0}, U_{C_0}, V_{C_0}, U_{B_1}, V_{B_1}, U_{C_1}, V_{C_1}] = \operatorname{solveUV}(Q_{B_0}, R_{B_0}, Q_{C_0}, R_{C_0}, Q_{B_1}, R_{B_1}, Q_{C_1}, R_{C_1})

  1. // Keep the columns U∗U_* in Q∗Q_* where the diagonal elements of R∗R_* are non-zero, satisfying B∗=UB∗VB∗†,C∗=UC∗VC∗†B_* = U_{B_*}V_{B_*}^{\dagger}, C_* = U_{C_*}V_{C_*}^{\dagger}

  1. // Step 2: Precompute quantities independent of the iteration

  1. A1invUB1=A1−1UB1A1invUB1 = A_1^{-1}U_{B_1}

  1. A1invUC1=A1−1UC1A1invUC1 = A_1^{-1}U_{C_1}

  1. A1invUC0=A1−1UC0A1invUC0 = A_1^{-1}U_{C_0}

  1. A0invUB0=A0−1UB0A0invUB0 = A_0^{-1}U_{B_0}

  1. P=VB1†×A1invUC1P = V_{B_1}^{\dagger} \times A1invUC1

  1. Q=VB1†×A1invUB1Q = V_{B_1}^{\dagger} \times A1invUB1

  1. R=VC1†×A1invUB1R = V_{C_1}^{\dagger} \times A1invUB1

  1. T=VC1†×A1invUC1T = V_{C_1}^{\dagger} \times A1invUC1

  1. // Step 3: Solve for the L~1=VB1′L\widetilde{L}_1 = V_{B_1}^{\prime}L using low-rank Riccati iteration

  1. Lt=0Lt = 0

  1. for i=1i = 1 to maximum iterations do:

  1. Ltnew=−P+Q⋅[(IB1+Lt×R)−1×(Lt×T)]\mathit{Ltnew} = -P + Q \cdot[(I_{B_1} + Lt \times R)^{-1} \times(Lt \times T)]

  1. if ∥Ltnew−Lt∥F/(∥Lt∥F+eps)<error tolerance\lVert Ltnew - Lt \rVert_F / (\lVert Lt \rVert_F + eps) < error\ tolerance then

  1. break

  1. end

  1. Lt=LtnewLt = Ltnew

  1. end

  1. // Step 4: Precompute fixed matrices for Woodbury formula

  1. VBLfinal=LtVBLfinal = Lt

  1. Kbulk=IrB1+Lt×RKbulk = I_{r_{B_1}} + Lt \times R

  1. Sbulk=Kbulk−1×[Lt×(VC1†×A1invUC0)]Sbulk = Kbulk^{-1} \times[Lt \times(V_{C_1}^{\dagger} \times A1invUC0)]

  1. z11UC0=A1invUC0−A1invUB1×Sbulkz11UC0 = A1invUC0 - A1invUB1 \times Sbulk

  1. // Step 5: Construct the boundary Green's function using the Woodbury formula

  1. L00=VB0†×z11UC0L00 = V_{B_0}^{\dagger} \times z11UC0

  1. Kbd=I−Lt00×VC0†×A0invUB0Kbd = I - Lt00 \times V_{C_0}^{\dagger} \times A0invUB0

  1. // Step 6: Estimate tr⁡(Z00)\operatorname{tr}(Z_{00}) using Hutchinson's method

  1. z=randomVector⁡(m)z = \operatorname{randomVector}(m)

  1. // Generate mm Rademacher random vectors

  1. w=A0−1zw = A_0^{-1}z

  1. s=Kbd−1×Lt00×(VC0†×w)s = Kbd^{-1} \times Lt00 \times(V_{C_0}^{\dagger} \times w)

  1. Z00z=w+A0invUB0×sZ00z = w + A0invUB0 \times s

  1. sumtr=sum⁡(z′×Z00z)sumtr = \operatorname{sum}(z' \times Z00z)

  1. //Calculate each column's zi′×(Z00×zi)z_i' \times(Z00 \times z_i)

  1. trZ00=sumtr/mtrZ00 = sumtr/m

  1. return trZ00trZ00

LIM for Two Semi-Infinite Crystals Interfaced with Each Other

This section presents the LIM for two semi-infinite crystals separated by another crystal slab, which corresponds to the photonic crystal in Figure 3(d) and the phononic crystal in Figure 3(j) of the main text. The operator matrix M\mathbf{M} of both systems can be expressed as:

M=(⋱⋱⋱C11A11B11C11A11B12C21A22B22C22A22B22⋱⋱⋱)(36)\mathbf{M} = \begin{pmatrix} \ddots& \ddots& \ddots& \\ & C_{11} & A_{11} & B_{11} \\ \hline & C_{11} & A_{11} & B_{12} \\ \hline & & C_{21} & A_{22} & B_{22} \\ & & & C_{22} & A_{22} & B_{22} \\ & & & & \ddots& \ddots& \ddots \end{pmatrix} \tag*{(36)}

For these systems, the interface concatenation no longer includes an independent surface layer. Instead, it is composed of the last A11A_{11} layer on the left and the first A22A_{22} layer on the right.

The Green’s functions on both sides zLz_L and zRz_R respectively satisfy:

{zL=(A11+C11SL)−1,zR=(A22+B22SR)−1.(37)\begin{cases} z_L = (A_{11} + C_{11}S_L)^{-1},\\ z_R = (A_{22} + B_{22}S_R)^{-1}. \tag*{(37)} \end{cases}

where SLS_L and SRS_R represent the transfer matrices. Therefore, the intermediate effective matrix should be defined as the block Green’s function on the two layers of the interface:

Meff=[ZL−1B12C21ZR−1](38)M_{\mathrm{eff}} = \begin{bmatrix} Z_L^{-1} & B_{12} \\ C_{21} & Z_R^{-1} \end{bmatrix} \tag*{(38)}

And the Green’s function in the middle of the interface is strictly defined as:

Zeff=Meff−1=[G11G12G21G22](39)Z_{\mathrm{eff}} = M_{\mathrm{eff}}^{-1} = \begin{bmatrix} G_{11} & G_{12} \\ G_{21} & G_{22} \end{bmatrix} \tag*{(39)}

This expression can also be converted into an explicit form via Woodbury transformations. Specially, the Woodbury factor in the pseudo-code satisfies:

Uint=(UC110UB1200UB220UC21),Vint=(VB1100VC210VC22VB120),(40)U_{int}=\begin{pmatrix} U_{C_{11}} & 0 & U_{B_{12}} & 0 \\ 0 & U_{B_{22}} & 0 & U_{C_{21}} \end{pmatrix},\quad V_{int}=\begin{pmatrix} V_{B_{11}} & 0 & 0 & V_{C_{21}} \\ 0 & V_{C_{22}} & V_{B_{12}} & 0 \end{pmatrix}, \tag*{(40)}
L~int=−blkdiag⁡(L~11,L~22,IB12,IC21)(41)\widetilde{L}_{int}=-\operatorname{blkdiag}\left(\widetilde{L}_{11},\widetilde{L}_{22},I_{B_{12}},I_{C_{21}}\right) \tag*{(41)}

and the surface of Woodbury transformations is:

Zint=Aint−1+Aint−1Uint†[I−L~intVint†Aint−1Uint]−1L~intVint†Aint−1(42)Z_{int}=A_{int}^{-1}+A_{int}^{-1}U_{int}^{\dagger}\left[I-\widetilde{L}_{int}V_{int}^{\dagger}A_{int}^{-1}U_{int}\right]^{-1}\widetilde{L}_{int}V_{int}^{\dagger}A_{int}^{-1} \tag*{(42)}

where Aint=blkdiag⁡(A11,A22)A_{int}=\operatorname{blkdiag}\left(A_{11},A_{22}\right).

The final SDOS can be expressed as a trace involving ZintZ_{int}, which can likewise be obtained using the stochastic trace estimation:

tr⁡(Zint)=1m∑i=1mzi†Zintzi(43)\operatorname{tr}\left(Z_{int}\right)=\frac{1}{m}\sum_{i=1}^{m}z_i^{\dagger}Z_{int}z_i \tag*{(43)}

The following is the detailed pseudo-code of the algorithm 3:

Algorithm 3: LIM for two semi-infinite crystals interfaced with each other (fig:3d in the main text)

Initialization: A11A_{11}, B11B_{11}, C11C_{11}, A22A_{22}, B22B_{22}, C22C_{22}, B12B_{12}, C21C_{21} maximum iterations >0>0, error tolerance >0>0, number of random vectors >0>0

Output: tr⁡(Zmid)\operatorname{tr}\left(Z_{mid}\right) (trace of ZmidZ_{mid})

  1. // Step 1: Low-rank truncation of B∗B_{*} and C∗C_{*} using QR decomposition

  2. [QB11,RB11]=qr⁡(B11)\left[Q_{B_{11}},R_{B_{11}}\right]=\operatorname{qr}\left(B_{11}\right)

  3. [QC11,RC11]=qr⁡(C11)\left[Q_{C_{11}},R_{C_{11}}\right]=\operatorname{qr}\left(C_{11}\right)

  4. [QB22,RB22]=qr⁡(B22)\left[Q_{B_{22}},R_{B_{22}}\right]=\operatorname{qr}\left(B_{22}\right)

  5. [QC22,RC22]=qr⁡(C22)\left[Q_{C_{22}},R_{C_{22}}\right]=\operatorname{qr}\left(C_{22}\right)

  6. [QB12,RB12]=qr⁡(B12)\left[Q_{B_{12}},R_{B_{12}}\right]=\operatorname{qr}\left(B_{12}\right)

  7. [QC21,RC21]=qr⁡(C21)\left[Q_{C_{21}},R_{C_{21}}\right]=\operatorname{qr}\left(C_{21}\right)

  8. [UB11,VB11,UB22,VB22,UB12,VB12]=solveUV⁡(QB11,RB11,QB22,RB22,QB12,RB12)\left[U_{B_{11}},V_{B_{11}},U_{B_{22}},V_{B_{22}},U_{B_{12}},V_{B_{12}}\right]=\operatorname{solveUV}\left(Q_{B_{11}},R_{B_{11}},Q_{B_{22}},R_{B_{22}},Q_{B_{12}},R_{B_{12}}\right)

  9. [UC11,VC11,UC22,VC22,UC21,VC21]=solveUV⁡(QC11,RC11,QC22,RC22,QC21,RC21)\left[U_{C_{11}},V_{C_{11}},U_{C_{22}},V_{C_{22}},U_{C_{21}},V_{C_{21}}\right]=\operatorname{solveUV}\left(Q_{C_{11}},R_{C_{11}},Q_{C_{22}},R_{C_{22}},Q_{C_{21}},R_{C_{21}}\right)

  10. // Keep the columns U∗U_{*} in Q∗Q_{*} where the diagonal elements of R∗R_{*} are non-zero, satisfying B∗=UB∗VB∗†B_{*}=U_{B_{*}}V_{B_{*}}^{\dagger}, C∗=UC∗VC∗†C_{*}=U_{C_{*}}V_{C_{*}}^{\dagger}

  11. // Step 2: Precompute quantities independent of the iteration

  12. A11invUB11=A11−1UB11A_{11}^{inv}UB_{11}=A_{11}^{-1}U_{B_{11}}

  13. A11invUC11=A11−1UC11A_{11}^{inv}UC_{11}=A_{11}^{-1}U_{C_{11}}

14. A22invUB22 = A₂₂⁻¹U_B₂₂
15. A22invUC22 = A₂₂⁻¹U_C₂₂
16. Pleft = V_C₁₁ᵀ × A11invUB11
17. Qleft = V_C₁₁ᵀ × A11invUC11
18. Rleft = V_B₁₁ᵀ × A11invUC11
19. Tleft = V_B₁₁ᵀ × A11invUB11
20. Pright = V_B₂₂ᵀ × A22invUC22
21. Qright = V_B₂₂ᵀ × A22invUB22
22. Rright = V_C₂₂ᵀ × A22invUB22
23. Tright = V_C₂₂ᵀ × A22invUC22
24. // Step 3: Solve for the L using low-rank Riccati iteration
25. Ltleft = 0
26. Ltright = 0
27. for i = 1 to maximum iterations do:
28.     Kleft = I + Ltleft × Rleft
29.     LtLeftnew = −Pleft + Qleft × [Kleft⁻¹ × (Ltleft × Tleft)]
30.     if ‖LtLeftnew − LtLeft‖F/(‖LtLeft‖F + eps) < error tolerance then
31.         break
32.     end
33.     Ltleft = LtLeftnew
34. end
35. for i = 1 to maximum iterations do:
36.     Kright = I + Ltright × Rright
37.     Ltrightnew = −PlTright + Qright × [Kright⁻¹ × (Ltright × Tright)]
38.     if ‖Ltrightnew − Ltright‖F/(‖Ltright‖F + eps) < error tolerance then
39.         break
40.     end
41.     Ltright = Ltrightnew
42. end
43. // Step 4: Precompute fixed matrices for Woodbury formula
44. Ubd = [U_C₁₁, 0, U_B₂₂, 0; 0, U_B₂₂, 0, U_C₂₂]
45. Vbd = [V_B₁₁, 0, V_C₂₂, 0; 0, V_C₂₂, 0, V_B₁₂]
46. Ltint = − blkdiag(Ltleft, Ltright, I, I)
47. Aint = blkdiag(A₁₁, A₂₂)⁻¹ × Ubd
48. Kbd = I − Ltint × (Vbdᵀ × Aint)
49. // Step 6: Estimate tr(Z₀₀) using Hutchinson's method
50. z = randomVector(m)
51. // Generate m Rademacher random vectors
52. w = [A₁₁⁻¹ z(left), A₂₂⁻¹ z(right)]
53. s = Kbd⁻¹ × Ltint × (Vbdᵀ × w)
54. Zmidz = w + Aint × s
55. sumtr = sum(zᵀ × Z00z)
56. //Calculate each column's zᵢᵀ × Z00 × zᵢ
57. trZmid = sumtr/m
  1. return trZmid

LIM for Two Semi-Infinite Crystals Separated by Another Crystal Slab

This section presents the LIM for two semi-infinite crystals separated by another crystal slab, which corresponds to the system in Figure 3(g) of the main text. The operator matrix M\mathbf{M} of this system can be expressed as:

M=(⋱⋱⋱C11A11B11C11A11B01C10A00B02C20A22B22C22A22B22⋱⋱⋱)(44)\mathbf{M} = \begin{pmatrix} \ddots& \ddots& \ddots& & & \\ & \mathbf{C}_{11} & \mathbf{A}_{11} & \mathbf{B}_{11} & & \\ & & \mathbf{C}_{11} & \mathbf{A}_{11} & \mathbf{B}_{01} & \\ \hline & & & \mathbf{C}_{10} & \mathbf{A}_{00} & \mathbf{B}_{02} \\ \hline & & & & \mathbf{C}_{20} & \mathbf{A}_{22} & \mathbf{B}_{22} \\ & & & & & \mathbf{C}_{22} & \mathbf{A}_{22} & \mathbf{B}_{22} \\ & & & & & & \ddots& \ddots& \ddots \end{pmatrix} \tag*{(44)}

In this system, the bulk Green's function in both sides can be defined as:

{Z11=(A11−C11S11)−1Z22=(A22−B22S22)−1(45)\begin{cases} \mathbf{Z}_{11} = \left(\mathbf{A}_{11} - \mathbf{C}_{11}\mathbf{S}_{11}\right)^{-1} \\ \mathbf{Z}_{22} = \left(\mathbf{A}_{22} - \mathbf{B}_{22}\mathbf{S}_{22}\right)^{-1} \tag*{(45)} \end{cases}

and the surface Green's function satisfies:

Z00=(A00−C10Z11B01−B02Z22C20)−1(46)\mathbf{Z}_{00} = \left(\mathbf{A}_{00} - \mathbf{C}_{10}\mathbf{Z}_{11}\mathbf{B}_{01} - \mathbf{B}_{02}\mathbf{Z}_{22}\mathbf{C}_{20}\right)^{-1} \tag*{(46)}

This expression can also be converted into an explicit form via Woodbury transformations. The core expressions are as follows:

{z11=A11−1−A11−1UB11[I+L~11VC11A11−1UB11]−1L~11VC11⋅A11−1z22=A22−1−A22−1UB22[I+L~22VC22A22−1UB22]−1L~22VC22⋅A22−1(47)\begin{cases} \mathbf{z}_{11} = \mathbf{A}_{11}^{-1} - \mathbf{A}_{11}^{-1}\mathbf{U}_{B_{11}}\left[\mathbf{I}+\widetilde{\mathbf{L}}_{11}\mathbf{V}_{C_{11}}\mathbf{A}_{11}^{-1}\mathbf{U}_{B_{11}}\right]^{-1}\widetilde{\mathbf{L}}_{11}\mathbf{V}_{C_{11}}\cdot\mathbf{A}_{11}^{-1} \\ \mathbf{z}_{22} = \mathbf{A}_{22}^{-1} - \mathbf{A}_{22}^{-1}\mathbf{U}_{B_{22}}\left[\mathbf{I}+\widetilde{\mathbf{L}}_{22}\mathbf{V}_{C_{22}}\mathbf{A}_{22}^{-1}\mathbf{U}_{B_{22}}\right]^{-1}\widetilde{\mathbf{L}}_{22}\mathbf{V}_{C_{22}}\cdot\mathbf{A}_{22}^{-1} \tag*{(47)} \end{cases}

and the final surface Green’s function is:

Z00=A00−1+A00−1[UC10UB02][I−L~00[VC10†VC20†]A00−1[UB01UB02]]−1L~00[VC10†VC20†]A00−1(48)Z_{00}=A_{00}^{-1}+A_{00}^{-1}\begin{bmatrix}U_{C_{10}}&U_{B_{02}}\end{bmatrix}\left[I-\widetilde{L}_{00}\begin{bmatrix}V_{C_{10}}^{\dagger}\\V_{C_{20}}^{\dagger}\end{bmatrix}A_{00}^{-1}\begin{bmatrix}U_{B_{01}}&U_{B_{02}}\end{bmatrix}\right]^{-1}\widetilde{L}_{00}\begin{bmatrix}V_{C_{10}}^{\dagger}\\V_{C_{20}}^{\dagger}\end{bmatrix}A_{00}^{-1} \tag*{(48)}

where L~00=blkdiag⁡(VB01′Z11UC10, VB02′Z22UC20)\widetilde{L}_{00}=\operatorname{blkdiag}\left(V_{B_{01}}^{\prime}Z_{11}U_{C_{10}},\ V_{B_{02}}^{\prime}Z_{22}U_{C_{20}}\right).

The final SDOS can be expressed as a trace involving Z00Z_{00}, which can likewise be obtained using the stochastic trace estimation:

tr⁡(Z00)=1m∑i=1mzi†Z00zi(49)\operatorname{tr}(Z_{00})=\frac{1}{m}\sum_{i=1}^{m}z_i^{\dagger}Z_{00}z_i \tag*{(49)}

The following is the detailed pseudo-code of the algorithm 4:

Algorithm 4: LIM for two semi-infinite crystals separated by another crystal slab

(fig:3g in the main text)

Initialization:

A00A_{00}, B01B_{01}, C10C_{10}, B02B_{02}, C20C_{20}, A11A_{11}, B11B_{11}, C11C_{11}, A22A_{22}, B22B_{22}, C22C_{22}

maximum iterations >0>0, error tolerance >0>0, number of random vectors >0>0

Output:

tr⁡Z00\operatorname{tr}Z_{00} (trace of Z00Z_{00})

  1. // Step 1: Low-rank truncation of B∗B_* and C∗C_* using QR decomposition

  2. [QB01,RB01]=qr⁡(B01)[Q_{B_{01}},R_{B_{01}}]=\operatorname{qr}(B_{01})

  3. [QC10,RC10]=qr⁡(C10)[Q_{C_{10}},R_{C_{10}}]=\operatorname{qr}(C_{10})

  4. [QB02,RB02]=qr⁡(B02)[Q_{B_{02}},R_{B_{02}}]=\operatorname{qr}(B_{02})

  5. [QC20,RC20]=qr⁡(C20)[Q_{C_{20}},R_{C_{20}}]=\operatorname{qr}(C_{20})

  6. [QB11,RB11]=qr⁡(B11)[Q_{B_{11}},R_{B_{11}}]=\operatorname{qr}(B_{11})

  7. [QC11,RC11]=qr⁡(C11)[Q_{C_{11}},R_{C_{11}}]=\operatorname{qr}(C_{11})

  8. [QB22,RB22]=qr⁡(B22)[Q_{B_{22}},R_{B_{22}}]=\operatorname{qr}(B_{22})

  9. [QC22,RC22]=qr⁡(C22)[Q_{C_{22}},R_{C_{22}}]=\operatorname{qr}(C_{22})

  10. [UB01,VB01,UC10,VC10,UB02,VB02,UC20,VC20]=solveUV⁡(QB01,RB01,QC10,RC10,QB02,RB02,QC20,RC20)[U_{B_{01}},V_{B_{01}},U_{C_{10}},V_{C_{10}},U_{B_{02}},V_{B_{02}},U_{C_{20}},V_{C_{20}}]=\operatorname{solveUV}(Q_{B_{01}},R_{B_{01}},Q_{C_{10}},R_{C_{10}},Q_{B_{02}},R_{B_{02}},Q_{C_{20}},R_{C_{20}})

  11. [UB11,VB11,UC11,VC11,UB22,VB22,UC22,VC22]=solveUV⁡(QB11,RB11,QC11,RC11,QB22,RB22,QC22,RC22)[U_{B_{11}},V_{B_{11}},U_{C_{11}},V_{C_{11}},U_{B_{22}},V_{B_{22}},U_{C_{22}},V_{C_{22}}]=\operatorname{solveUV}(Q_{B_{11}},R_{B_{11}},Q_{C_{11}},R_{C_{11}},Q_{B_{22}},R_{B_{22}},Q_{C_{22}},R_{C_{22}})

  12. // Keep the columns U∗U_* in Q∗Q_* where the diagonal elements of R∗R_* are non-zero, satisfying

{B∗=UB∗VB∗†C∗=UC∗VC∗†\begin{cases} B_* = U_{B_*}V_{B_*}^{\dagger}\\ C_* = U_{C_*}V_{C_*}^{\dagger} \end{cases}
  1. // Step 2: Precompute quantities independent of the iteration

  2. A11invUB11=A11−1UB11A11invUB11=A_{11}^{-1}U_{B_{11}}

  3. A11invUC11=A11−1UC11A11invUC11=A_{11}^{-1}U_{C_{11}}

  4. A11invUC10=A11−1UC10A11invUC10=A_{11}^{-1}U_{C_{10}}

  5. A22invUB22=A22−1UB22A22invUB22=A_{22}^{-1}U_{B_{22}}

  6. A22invUC22=A22−1UC22A22invUC22=A_{22}^{-1}U_{C_{22}}

  7. A22invUC20=A22−1UC20A22invUC20=A_{22}^{-1}U_{C_{20}}

  8. Pleft=VB11×A11invUC11Pleft=V_{B_{11}}\times A11invUC11

  1. Qleft=VB11′×A11invUB11Qleft = V_{B_{11}}' \times A11invUB11

  2. Rleft=VC11′×A11invUB11Rleft = V_{C_{11}}' \times A11invUB11

  3. Tleft=VC11′×A11invUC11Tleft = V_{C_{11}}' \times A11invUC11

  4. Pright=VB22′×A22invUC22Pright = V_{B_{22}}' \times A22invUC22

  5. Qright=VB22′×A22invUB22Qright = V_{B_{22}}' \times A22invUB22

  6. Rright=VC22′×A22invUB22Rright = V_{C_{22}}' \times A22invUB22

  7. Tright=VC22′×A22invUC22Tright = V_{C_{22}}' \times A22invUC22

  8. // Step 3: Solve for the VB∗′LV_{B_*}'L using low-rank Riccati iteration

  9. Ltleft=0Ltleft = 0

  10. Ltright=0Ltright = 0

  11. for i=1i = 1 to maximum iterations do:

  12. Kleft=I+Ltleft×RleftKleft = I + Ltleft \times Rleft

  13. LtleftNew=−Pleft+Qleft×[Kleft−1×(Ltleft×Tleft)]LtleftNew = -Pleft + Qleft \times[Kleft^{-1} \times(Ltleft \times Tleft)]

  14. if ∥LtleftNew−Ltleft∥F/(∥Ltleft∥F+eps)<error tolerance\lVert LtleftNew - Ltleft \rVert_F / (\lVert Ltleft \rVert_F + eps) < error\ tolerance then

  15. break

  16. end

  17. Ltleft=LtleftNewLtleft = LtleftNew

  18. end

  19. for i=1i = 1 to maximum iterations do:

  20. Kright=I+Ltright×RrightKright = I + Ltright \times Rright

  21. LtrightNew=−Pright+Qright×[Kright−1×(Ltright×Tright)]LtrightNew = -Pright + Qright \times[Kright^{-1} \times(Ltright \times Tright)]

  22. if ∥LtrightNew−Ltright∥F/(∥Ltright∥F+eps)<error tolerance\lVert LtrightNew - Ltright \rVert_F / (\lVert Ltright \rVert_F + eps) < error\ tolerance then

  23. break

  24. end

  25. Ltright=LtrightNewLtright = LtrightNew

  26. end

  27. // Step 4: Precompute fixed matrices for Woodbury formula

  28. Kleft=I+Ltleft×RleftKleft = I + Ltleft \times Rleft

  29. Kright=I+Ltright×RrightKright = I + Ltright \times Rright

  30. ZleftUC10=A11invUC10−A11invUB11×{Kleft−1×[Ltleft×(VC11′×A11invUC10)]}ZleftUC10 = A11invUC10 - A11invUB11 \times\{Kleft^{-1} \times[Ltleft \times(V_{C_{11}}' \times A11invUC10)]\}

  31. ZrightUC20=A22invUC20−A22invUB22×{Kright−1×[Ltright×(VC22′×A22invUC20)]}ZrightUC20 = A22invUC20 - A22invUB22 \times\{Kright^{-1} \times[Ltright \times(V_{C_{22}}' \times A22invUC20)]\}

  32. // Step 5: Construct the boundary Green's function using the Woodbury formula

  33. Ubd=[UB01,UB02]Ubd = [U_{B_{01}}, U_{B_{02}}]

  34. Vbd=[VC10,VC20]Vbd = [V_{C_{10}}, V_{C_{20}}]

  35. A00invUbd=A00−1⋅UbdA00invUbd = A_{00}^{-1} \cdot Ubd

  36. Hleft=VB01†×ZleftUC10Hleft = V_{B_{01}}^{\dagger} \times ZleftUC10

  37. Hright=VB02†×ZrightUC20Hright = V_{B_{02}}^{\dagger} \times ZrightUC20

  38. Ltint=blkdiag⁡(Hleft,Hright)Ltint = \operatorname{blkdiag}(Hleft,Hright)

  39. Kbd=I−Ltint×(Vbd†×A00invUbd)Kbd = I - Ltint \times(Vbd^{\dagger} \times A00invUbd)

  40. // Step 6: Estimate tr⁡(Z00)\operatorname{tr}(Z_{00}) using Hutchinson's method

  41. z=randomVector(m)z = randomVector(m)

  42. // Generate mm Rademacher random vectors

  43. w=A00−1zw = A_{00}^{-1}z

  44. Z00z=w+A00invUbd×{Kbd−1×[Ltint×(Vbd†×w)]}Z00z = w + A00invUbd \times\{Kbd^{-1} \times[Ltint \times(Vbd^{\dagger} \times w)]\}

65. sumtr = sum(z† × Z00 × z)
66. //Calculate each column's z_i† × Z00 × z_i
67. trZ00 = sumtr/m
68. return trZ00

References

  1. [1]Bernevig, B. A. & Hughes, T. L. Topological insulators and topological superconductors. (Princeton university press, 2013).
  2. [2]Xue, H., Yang, Y. & Zhang, B. Topological Valley Photonics: Physics and Device Applications. Advanced Photonics Research 2, 2100013 (2021).DOI
  3. [3]Ma, S., Yang, B. & Zhang, S. Topological photonics in metamaterials. Photonics Insights 1, R02 (2022).DOI
  4. [4]Zhu, W. et al. Topological phononic metamaterials. Reports on Progress in Physics 86, 106501 (2023).arxiv.org/abs/2303.01426
  5. [5]Lu, L., Joannopoulos, J. D. & Soljačić, M. Topological photonics. Nature Photonics 8, 821–829 (2014).
  6. [6]Khanikaev, A. B. & Shvets, G. Two-dimensional topological photonics. Nature Photonics 11, 763–773 (2017).DOI
  7. [7]Leykam, D., Xue, H., Zhang, B. & Chong, Y. D. Limitations and possibilities of topological photonics. Nature Reviews Physics 8, 55–64 (2026).DOI
  8. [8]Zakeri, M. J., Perez-Leija, A. & Blanco-Redondo, A. High-dimensional topological photonic entanglement. Science 391, 1379–1382 (2026).
  9. [9]He, C., Zhao, L., Zhang, S., Zhou, L. & Ma, S. Intrinsic topological hinge states induced by boundary gauge fields in photonic metamaterials. eLight 5, 19 (2025).DOI
  10. [10]Ma, S. et al. Linked Weyl surfaces and Weyl arcs in photonic metamaterials. Science 373, 572–576 (2021).DOI
  11. [11]Yu, T.-J., Geng, Z.-G., Shen, Y.-X., Chen, Z. & Zhu, X.-F. Directional sound transport via coupled topological states in heterostructure sonic crystals with mirrored interfaces. Physical Review Applied 25, 024057 (2026).
  12. [12]Yuan, Y. et al. Supersymmetric Landau Levels in Subwavelength Type-I Dirac Metasurfaces. Physical Review Letters 136, 023802 (2026).DOI
  13. [13]Zhirihin, D. V. et al. Helical metasurfaces based on topological surface states in three-dimensional photonic topological insulators. Nature Materials 25, 762–766 (2026).DOI
  14. [14]Ma, Q. et al. Floquet topological states in time-varying metasurfaces. Science Advances 11, eadx9025 (2025).DOI
  15. [15]Qin, S. et al. Multifunctional Topological Metasurfaces with Modular Meta-Atoms for Multidimensional Wave Control. Advanced Optical Materials 13, 2500044 (2025).DOI
  16. [16]Ma, S. et al. Gauge Field Induced Chiral Zero Mode in Five-Dimensional Yang Monopole Metamaterials. Physical Review Letters 130, 243801 (2023).DOI
  17. [17]Rahachou, A. I. & Zozoulenko, I. V. Light propagation in finite and infinite photonic crystals: The recursive Green's function technique. Physical Review B 72, 155117 (2005).DOI
  18. [18]Sainidou, R., Stefanou, N. & Modinos, A. Green's function formalism for phononic crystals. Physical Review B 69, 064301 (2004).DOI
  19. [19]Rother, T. Green's functions in classical physics. Vol. 938 (Springer, 2017).DOI
  20. [20]Stakgold, I. & Holst, M. J. Green's functions and boundary value problems. Vol. 9 (Wiley New York, 1979).
  21. [21]Cederbaum, L. S. One-body Green's function for atoms and molecules: theory and application. Journal of Physics B: Atomic and Molecular Physics 8, 290 (1975).DOI
  22. [22]von Niessen, W., Schirmer, J. & Cederbaum, L. S. Computational methods for the one-particle green's function. Computer Physics Reports 1, 57–125 (1984).DOI
  23. [23]Economou, E. N. in Green’s Functions in Quantum Physics (ed Eleftherios N. Economou) 215–238 (Springer Berlin Heidelberg, 1983).
  24. [24]Sancho, M. P. L., Sancho, J. M. L. & Rubio, J. Quick iterative scheme for the calculation of transfer matrices: application to Mo (100). Journal of Physics F: Metal Physics 14, 1205 (1984).
  25. [25]Sancho, M. P. L., Sancho, J. M. L., Sancho, J. M. L. & Rubio, J. Highly convergent schemes for the calculation of bulk and surface Green functions. Journal of Physics F: Metal Physics 15, 851 (1985).
  26. [26]Metalidis, G. & Bruno, P. Green's function technique for studying electron flow in two-dimensional mesoscopic samples. Physical Review B 72, 235304 (2005).DOI
  27. [27]Haydock, R., Heine, V. & Kelly, M. J. Electronic structure based on the local atomic environment for tight-binding bands. Journal of Physics C: Solid State Physics 5, 2845 (1972).DOI
  28. [28]Haydock, R. The Recursive Solution of the Schrodinger Equation. Solid state physics 35, 215–294 (1980).
  29. [29]Lee, D. H. & Joannopoulos, J. D. Renormalization scheme for the transfer-matrix method and the surfaces of wurtzite ZnO. Physical Review B 24, 6899–6907 (1981).DOI
  30. [30]Lee, D. H. & Joannopoulos, J. D. A new theory of electronic surface states. Journal of Vacuum Science and Technology 19, 355–359 (1981).DOI
  31. [31]Lee, D. H. & Joannopoulos, J. D. Simple scheme for surface-band calculations. II. The Green's function. Physical Review B 23, 4997–5004 (1981).DOI
  32. [32]Lee, D. H. & Joannopoulos, J. D. Simple scheme for surface-band calculations. I. Physical Review B 23, 4988–4996 (1981).DOI
  33. [33]Boffi, D., Conforti, M. & Gastaldi, L. Modified edge finite elements for photonic crystals. Numerische Mathematik 105, 249–266 (2006).DOI
  34. [34]Hiett, B. P. et al. Application of finite element methods to photonic crystal modelling. IEE Proceedings - Science, Measurement and Technology 149, 293–296 (2002).DOI
  35. [35]Axmann, W. & Kuchment, P. An Efficient Finite Element Method for Computing Spectra of Photonic and Acoustic Band-Gap Materials: I. Scalar Case. Journal of Computational Physics 150, 468–481 (1999).DOI
  36. [36]Brechet, F., Marcou, J., Pagnoux, D. & Roy, P. Complete Analysis of the Characteristics of Propagation into Photonic Crystal Fibers, by the Finite Element Method. Optical Fiber Technology 6, 181–191 (2000).
  37. [37]Sha, Y.-X. et al. Surface density of states on semi-infinite topological photonic and acoustic crystals. Physical Review B 104, 115131 (2021).DOI
  38. [38]Sha, Y.-X., Xia, M.-Y., Lu, L. & Yang, Y. Efficient algorithms for the surface density of states in topological photonic and acoustic systems. Nature Computational Science 5, 1192–1201 (2025).DOI
  39. [39]Wang, Z., Chong, Y., Joannopoulos, J. D. & Soljačić, M. Observation of unidirectional backscattering-immune topological electromagnetic states. Nature 461, 772–775 (2009).DOI
  40. [40]Sherman, J. & Morrison, W. J. Adjustment of an inverse matrix corresponding to a change in one element of a given matrix. The Annals of Mathematical Statistics 21, 124–127 (1950).
  41. [41]Golub, G. H. & Van Loan, C. F. Matrix Computations - 4th Edition. (Johns Hopkins University Press, 2013).
  42. [42]Hutchinson, M. F. A stochastic estimator of the trace of the influence matrix for Laplacian smoothing splines. Communications in Statistics-Simulation and Computation 18, 1059–1076 (1989).
  43. [43]Chen, T. & Hallman, E. Krylov-Aware Stochastic Trace Estimation. SIAM Journal on Matrix Analysis and Applications 44, 1218–1244 (2023).DOI
  44. [44]Rylander, T. & Bondeson, A. Stable FEM-FDTD hybrid method for Maxwell's equations. Computer Physics Communications 125, 75–82 (2000).DOI
  45. [45]Yang, B. et al. Ideal Weyl points and helicoid surface states in artificial photonic crystal structures. Science 359, 1013–1016 (2018).DOI
  46. [46]George, A. Nested Dissection of a Regular Finite Element Mesh. SIAM Journal on Numerical Analysis 10, 345–363 (1973).DOI
  47. [47]Amestoy, P. et al. Combining Sparse Approximate Factorizations with Mixed-precision Iterative Refinement. ACM Trans. Math. Softw. 49, 4 (2023).DOI
  48. [48]Soler, J. M. et al. The SIESTA method for ab initio order-N materials simulation. Journal of Physics: Condensed Matter 14, 2745 (2002).DOI
  49. [49]Marzari, N. & Vanderbilt, D. Maximally localized generalized Wannier functions for composite energy bands. Physical Review B 56, 12847–12865 (1997).DOI
  50. [50]Liu, K. et al. Source Code and Data for the paper "Low-Rank Iteration for Efficient Calculations of Topological Surface States". Science Data Bank https://doi.org/10.57760/sciencedb.017v3 (2026).

Paper details

vlnc:W_umrz9afb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents