pith. sign in

arxiv: 2605.24982 · v1 · pith:2TEZJM4Anew · submitted 2026-05-24 · 🧮 math.NA · cs.NA· physics.comp-ph

A Guided Tour of Modern Domain Decomposition: From Schwarz Iterations to Robust Preconditioners and HPC Implementations

Victorita Dolean , Pierre Jolivet , Fr\'ed\'eric Nataf , Pierre-Henri Tournier This is my paper

Pith reviewed 2026-06-29 23:36 UTC · model grok-4.3

classification 🧮 math.NA cs.NAphysics.comp-ph
keywords domain decompositionSchwarz methodspreconditionerscoarse spacesGenEOKrylov solversparallel computingnumerical PDEs
0
0 comments X

The pith

Domain decomposition methods unify scalable solutions of partial differential equations by combining local subdomain solves with coarse space corrections for global convergence.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper surveys the development of domain decomposition methods from their origins in Schwarz alternating iterations to their use as preconditioners in Krylov subspace solvers. It shows how overlapping decompositions, partition of unity, and additive or restricted formulations deliver local robustness and natural parallelism. The authors emphasize that coarse space corrections become essential for scalability when solving indefinite or high-frequency problems at large scale. They distill practical design principles from two decades of work, with focus on robust constructions such as GenEO and Dirichlet-to-Neumann coarse spaces. The result is a coherent overview intended as a practice-oriented guide rather than a full literature review.

Core claim

Domain decomposition methods supply a unifying framework for scalable numerical solution of partial differential equations: local subdomain solves provide robustness and parallelism while coarse space corrections guarantee global convergence rates independent of mesh size and frequency in indefinite and high-frequency regimes.

What carries the argument

Coarse space corrections (GenEO and DtN-based approaches) inserted into additive or restricted Schwarz preconditioners to control the spectrum of the preconditioned operator in Krylov solvers.

If this is right

  • Large-scale simulations of partial differential equations become feasible on distributed-memory architectures without iteration counts that grow with problem size.
  • Algebraic interpretations of Schwarz methods allow direct implementation inside existing Krylov libraries.
  • Robust coarse spaces extend the applicability of domain decomposition beyond elliptic problems to indefinite and high-frequency wave problems.
  • High-performance computing implementations can exploit the natural subdomain parallelism while retaining theoretical convergence bounds.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same coarse-space design principles might be tested on time-dependent or nonlinear problems not covered in the survey.
  • Algebraic versions of the reviewed methods could be compared directly with algebraic multigrid on the same set of indefinite test cases.
  • The practice-oriented guide could be used to select a coarse space for a new application by matching the problem's indefiniteness level to the GenEO or DtN construction.

Load-bearing premise

Insights and performance guarantees drawn from earlier literature on GenEO and DtN coarse spaces continue to hold for the indefinite and high-frequency regimes described.

What would settle it

Numerical experiments on a sequence of increasingly fine meshes or higher frequencies showing that iteration counts in the preconditioned Krylov solver grow without bound when the coarse space is omitted.

Figures

Figures reproduced from arXiv: 2605.24982 by Fr\'ed\'eric Nataf, Pierre-Henri Tournier, Pierre Jolivet, Victorita Dolean.

Figure 1
Figure 1. Figure 1: Examples of wave propagation in complex domains: brain imaging for stroke localization [24] (left, center), and current injection in an electric component (right). 2 [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: End of Dennard scaling frequency gains stall [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Performance trend of the Top500 supercomputers (sum, #1, #500) over the last three decades. The remainder of this section develops the main domain decomposition concepts and their al￾gebraic versions, preparing their use as standalone iterative methods and as preconditioners for Krylov solvers. 4 [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Two overlapping subdomains Ω1 and Ω2 for Schwarz alternating itera￾tion. ▷ Key observations Schwarz’ method already contains the main ingredients of a hybrid solver: local solves on subdomains, communication through interface conditions, and a global iteration built from these local updates. Overlap is essential for contraction in the classical elliptic setting. With vanishing overlap, the basic alternatin… view at source ↗
Figure 5
Figure 5. Figure 5: Overlapping subdomains Ω1 = [0, b] and Ω2 = [a, 1] with minimum overlap and a partition of unity (ξ1, ξ2) for this decomposition. ▷ Key insight With the domain splitting (18), the local solves (19) correspond precisely to the block￾Jacobi update (13)–(14). Hence for minimal overlap, Additive Schwarz (AS) and Restricted Additive Schwarz (RAS) coincide at the algebraic level: they all reduce to a block-Jacob… view at source ↗
Figure 6
Figure 6. Figure 6: Extension of subdomains to overlapping neighborhoods in a stencil￾based discretization. Graph-based partitioning Given a sparse matrix A, the associated (symmetrized) graph has an edge (i, j) whenever Aij ̸= 0. Standard graph partitioners such as METIS [16] or SCOTCH [8] compute balanced node partitions, thereby achieving the following goals: • Load balance: each subdomain carries roughly the same number o… view at source ↗
Figure 7
Figure 7. Figure 7: Overlapping finite element subdomains {Ωi} covering Ω. 1.6 Schwarz preconditioners in Krylov methods Large-scale PDE discretizations are rarely solved by stationary iterations. In practice, Schwarz operators are used as preconditioners inside Krylov subspace methods. Consider the linear system AU = F. Given a linear preconditioner M−1 , a left-preconditioned Krylov method builds the Krylov space generated … view at source ↗
Figure 8
Figure 8. Figure 8: Iteration growth with subdomain count (1-level ASM) Ω1 Ω2 Ω3 Ω4 Ω5 Ω6 Ω7 One-level Schwarz: local communication only Ω1 Ω2 Ω3 Ω4 Ω5 Ω6 Ω7 coarse space Two-level Schwarz: local + global communication local communication global (coarse) communication [PITH_FULL_IMAGE:figures/full_fig_p015_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Overlapping subdomains on a long domain. One-level Schwarz exchanges information only with neighbors through overlaps, so global effects propagate gradually across the chain. A two-level method adds a coarse component (blue) that provides a global communication channel, enabling rapid transport of low-frequency information independently of the number of subdomains. This growth is a direct consequence of th… view at source ↗
Figure 10
Figure 10. Figure 10: Increas￾ing domain decompo￾sition granularity. ▷ Spectral interpretation The loss of weak scalability is caused by a small number of global, low-frequency modes that are only weakly affected by local subdomain solves. As N increases, these modes lead to 17 [PITH_FULL_IMAGE:figures/full_fig_p017_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Schematic Nicolaides coarse basis function. The vector Zi = RT i DiRi1 equals one on the non￾overlapping core of Ωi and decays smoothly to zero across the overlap region under the partition-of-unity weights Di . Scalability guarantee. Although extremely low-dimensional (one basis vector per subdomain), the Nicolaides coarse space is already sufficient to restore weak scalability for homogeneous scalar dif… view at source ↗
Figure 12
Figure 12. Figure 12: Examples of heterogeneous coefficients that challenge classical coarse spaces. GenEO (Generalized Eigenproblems in the Overlap) [22] constructs a coarse space by identifying, on each subdomain, error components that are poorly reduced by local solves. These compo￾nents are detected by solving local generalized eigenproblems and selecting the corresponding low-energy modes. Coarse space construction For ea… view at source ↗
Figure 13
Figure 13. Figure 13: shows the heterogeneous coefficient field, the corresponding pressure solution, and the two decompositions. The results demonstrate that GenEO remains robust independently of both coefficient variations and the choice of partitioning. IsoValue -78946.3 39474.7 118422 197369 276317 355264 434211 513159 592106 671053 750001 828948 907895 986842 1.06579e+06 1.14474e+06 1.22368e+06 1.30263e+06 1.38158e+06 1.5… view at source ↗
Figure 14
Figure 14. Figure 14: GM￾RES convergence in heterogeneous (not nearly incom￾pressible) elasticity. GenEO restores rapid convergence compared to ASM and Nicolaides coarse spaces. Quantitative Comparison. The following table compares the number of eigenvectors per 22 [PITH_FULL_IMAGE:figures/full_fig_p022_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Typ￾ical local GenEO spectrum (log scale): only a few low-energy modes are selected for the coarse space. These experiments confirm that GenEO achieves robustness with respect to heterogeneity, near￾null modes, and partitioning, while keeping the coarse space dimension small. 2.5 The fictitious space lemma: an abstract framework The analysis of Schwarz-type preconditioners can be cast in a unified form by… view at source ↗
Figure 16
Figure 16. Figure 16: 2D sandwich: steel core and rubber layers. The domain is partitioned using METIS for optimal subdomain layout: 26 [PITH_FULL_IMAGE:figures/full_fig_p026_16.png] view at source ↗
Figure 17
Figure 17. Figure 17: Hierarchy of Schwarz-based methods and their two-level extensions. Key Takeaways • Spectral coarse spaces are essential to ensure robustness and scalability in the presence of multiscale and high-contrast features. • GenEO adapts automatically to material heterogeneity, reducing iteration counts and enabling convergence even at massive scales. • Convergence guarantees are available for a wide class of met… view at source ↗
Figure 18
Figure 18. Figure 18: Typical oscillatory Helmholtz solution at moderate￾to-high frequency. Discretisation should capture oscillations A first requirement is resolution: the mesh must capture oscillations. A second, more subtle, requirement is dispersion control (the pollution effect), which forces additional refinement beyond points-per-wavelength heuristics. 29 [PITH_FULL_IMAGE:figures/full_fig_p029_18.png] view at source ↗
Figure 19
Figure 19. Figure 19: Left: FD and FE solutions. Right: FE mesh and vertical profile comparison. 30 [PITH_FULL_IMAGE:figures/full_fig_p030_19.png] view at source ↗
Figure 20
Figure 20. Figure 20: Illustration of a geometric coarse space: coarse mesh hierarchy and a typical two-level decomposition (schematic). For indefinite wave problems, the simple application of the above doesn’t work as the situation is quite delicate and requires additional assumptions. Consider the absorptive (shifted Laplacian) Helmholtz operator −∆ − (k 2 + iξ), where k is the wavenumber and ξ > 0 introduces absorption. The… view at source ↗
Figure 21
Figure 21. Figure 21: Velocity field of the GO_3D_OBS crustal model (left), adapted mesh conforming to bathymetry (right). Weak scalability: frequency sweep We next perform weak scaling experiments on GO_3D_OBS using finite differences. (At very high frequencies and extreme problem sizes, finite differences are preferred over finite elements for memory and assembly efficiency.) [PITH_FULL_IMAGE:figures/full_fig_p035_21.png] view at source ↗
Figure 22
Figure 22. Figure 22: Iteration count versus frequency (weak scal￾ing). The results show that iteration counts increase with frequency, as expected for indefinite wave problems, while total runtimes remain relatively stable at moderate frequencies. At the largest scales and highest frequencies, a controlled degradation of weak-scaling efficiency is observed, reflecting the combined impact of stronger indefiniteness and increas… view at source ↗
Figure 23
Figure 23. Figure 23: Strong scaling at 3.75 Hz: FD case (left) and FE case (right). In both cases, the solver exhibits nearly linear speedup, confirming good parallel efficiency even at very large problem sizes. Time-to-solution comparison: time vs frequency domain Finally, we compare: • a classical time-domain FDTD solver, • a direct frequency-domain solver (MUMPS), • and an ORAS-preconditioned Krylov solver, 36 [PITH_FULL_… view at source ↗
Figure 24
Figure 24. Figure 24: The overlapping mesh decomposition with -ffddm_overlap 1 (left) and -ffddm_overlap 3 (right). 7 ffddmbuildDfespace(FE, M, real, P2) 4.3 Step 3: Define the problem to solve ffddmsetupOperator builds the distributed operator associated to the variational problem that we want to solve: 9 macro grad(u) [dx(u), dy(u)] // End of macro 10 macro Varf(varfName, meshName, null) 11 varf varfName(u,v) = int2d(meshNam… view at source ↗
Figure 25
Figure 25. Figure 25: Plot the global solution with ffddmplot. The full terminal output of the script is transcribed below: 42 [PITH_FULL_IMAGE:figures/full_fig_p042_25.png] view at source ↗
read the original abstract

Domain decomposition methods (DDMs) provide a unifying framework for the scalable numerical solution of partial differential equations. Originating from Schwarz's alternating method, they have evolved into a rich family of algorithms that combine local robustness with global convergence acceleration and natural parallelism. Over the past decades, domain decomposition has played a central role in enabling large-scale simulations in numerous applications. This chapter presents an overview of modern DDMs, with a particular emphasis on scalable preconditioning techniques for challenging problems, including indefinite and high-frequency regimes. We revisit the fundamental concepts - overlapping decompositions, partition of unity, additive and restricted Schwarz formulations - and explain their algebraic interpretations. We then clarify their role as preconditioners in Krylov subspace solvers and discuss the necessity of coarse space corrections for scalability. Beyond a the survey aspect, the chapter distills key theoretical insights and practical design principles that have emerged over the past twenty years. Special attention is given to robust coarse spaces (GenEO, DtN-based approaches) and high-performance implementations. The goal is to provide both a coherent overview of the field and a concise, practice-oriented guide for readers seeking to understand and apply domain decomposition methods without navigating the entire literature.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. This manuscript is a survey chapter on domain decomposition methods (DDMs) for scalable numerical solution of PDEs. It traces the evolution from Schwarz alternating iterations through overlapping decompositions, partition of unity, additive/restricted Schwarz formulations and their algebraic interpretations, to their use as preconditioners in Krylov solvers. The central emphasis is the necessity of coarse-space corrections (e.g., GenEO and DtN-based) for scalability in indefinite and high-frequency regimes, together with practical design principles and HPC implementation considerations drawn from the literature of the past twenty years.

Significance. If the distillation of existing theoretical insights and design principles is accurate, the chapter provides a coherent, practice-oriented guide that unifies concepts across the DDM literature and highlights robust coarse-space constructions needed for challenging regimes. This could reduce the barrier for readers applying these methods to large-scale simulations without surveying the full body of prior work.

minor comments (2)
  1. [Abstract] Abstract: the phrase 'Beyond a the survey aspect' contains a typographical error and should read 'Beyond the survey aspect'.
  2. The manuscript would benefit from explicit pointers (section or equation numbers) to the specific theorems or numerical results in the cited GenEO and DtN literature that underpin the claimed robustness in indefinite/high-frequency regimes.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive overall assessment of the manuscript. The referee's summary accurately reflects the scope, emphasis on robust coarse spaces, and practical orientation of the survey. We note the recommendation for minor revision.

Circularity Check

0 steps flagged

No circularity: survey chapter with no internal derivations or predictions

full rationale

The manuscript is framed as a survey that revisits established concepts from the literature (Schwarz methods, GenEO, DtN coarse spaces) and distills prior insights without new proofs, equations, or performance claims of its own. No load-bearing steps exist that could reduce by construction to self-citations, fitted inputs, or self-definitions, as confirmed by the absence of any derivation chain or novel quantitative results.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

As a survey paper, the work introduces no new free parameters, axioms beyond standard numerical analysis, or invented entities; it relies on and summarizes prior literature.

axioms (1)
  • domain assumption Standard assumptions of existence, uniqueness, and well-posedness for the underlying PDE boundary value problems
    Invoked implicitly when discussing convergence and preconditioning of the methods for PDEs.

pith-pipeline@v0.9.1-grok · 5766 in / 1255 out tokens · 43087 ms · 2026-06-29T23:36:50.027386+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

25 extracted references · 13 canonical work pages

  1. [1]

    Badia, S., Verdugo, F.: Gridap: An extensible finite element toolbox in Julia. J. Open Source Softw. 5(52), 2520 (2020)

    2020

  2. [2]

    F., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., Dalcin, L., Dener, A., Eijkhout, V., Faibussowitsch, J., Gropp, W

    Balay, S., Abhyankar, S., Adams, M. F., Benson, S., Brown, J., Brune, P., Buschelman, K., Constantinescu, E., Dalcin, L., Dener, A., Eijkhout, V., Faibussowitsch, J., Gropp, W. D., Hapla, V., Isaac, T., Jolivet, P., Karpeev, D., Kaushik, D., Knepley, M. G., Kong, F., Kruger, S., May, D. A., McInnes, L. C., Mills, R. T., Mitchell, L., Munson, T., Roman, J....

    2025

  3. [3]

    Bonazzoli, M., Dolean, V., Graham, I.G., Spence, E.A., Tournier, P.-H.: Domain decom- position preconditioning for the high-frequency time-harmonic Maxwell equations with ab- sorption. Math. Comp. 88(320), 2559–2604 (2019). doi:10.1090/mcom/3447

    work page doi:10.1090/mcom/3447 2019

  4. [4]

    Bootland, N., Dolean, V., Jolivet, P., Tournier, P.-H.: A comparison of coarse spaces for Helmholtz problems in the high-frequency regime. Comput. Math. Appl. 98, 239–253 (2021). doi:10.1016/j.camwa.2021.07.011

    work page doi:10.1016/j.camwa.2021.07.011 2021

  5. [5]

    Bootland, N., Dolean, V., Graham, I.G., Ma, C., Scheichl, R.: Overlapping Schwarz methods with GenEO coarse spaces for indefinite and non-self-adjoint problems. IMA J. Numer. Anal. (2022). doi:10.1093/imanum/drac036

    work page doi:10.1093/imanum/drac036 2022

  6. [6]

    Bootland, N., Dolean, V.: Can DtN and GenEO coarse spaces be sufficiently ro- bust for heterogeneous Helmholtz problems? Math. Comput. Appl. 27(3) (2022). doi:10.3390/mca27030035

    work page doi:10.3390/mca27030035 2022

  7. [7]

    Cai, X.-C., Sarkis, M.: A restricted additive Schwarz preconditioner for general sparse linear systems. SIAM J. Sci. Comput. 21(2), 792–797 (1999). doi:10.1137/S106482759732678X

    work page doi:10.1137/s106482759732678x 1999

  8. [8]

    Parallel Comput

    Chevalier, C., Pellegrini, F.: PT-Scotch: A tool for efficient parallel graph ordering. Parallel Comput. 34(6–8), 318–331 (2008). doi:10.1016/j.parco.2007.12.001

    work page doi:10.1016/j.parco.2007.12.001 2008

  9. [9]

    Conen, L., Dolean, V., Krause, R., Nataf, F.: A coarse space for heterogeneous Helmholtz problems based on the Dirichlet-to-Neumann operator. J. Comput. Appl. Math. 271, 83–99 (2014). doi:10.1016/j.cam.2014.03.031

    work page doi:10.1016/j.cam.2014.03.031 2014

  10. [10]

    SIAM, Philadelphia (2015)

    Dolean, V., Jolivet, P., Nataf, F.: An introduction to domain decomposition methods: Algo- rithms, theory, and parallel implementation . SIAM, Philadelphia (2015)

    2015

  11. [11]

    Dolean, V., Fry, M., Langer, M.: Can symmetric positive definite (SPD) coarse spaces perform well for indefinite Helmholtz problems? J. Comput. Appl. Math. 484(1) (2026)

    2026

  12. [12]

    Graham, I.G., Spence, E.A., Vainikko, E.: Domain decomposition preconditioning for high- frequency Helmholtz problems with absorption. Math. Comp. 86(307), 2089–2127 (2017)

    2089

  13. [13]

    Jolivet, P., Dolean, V., Hecht, F., Nataf, F., Prud’Homme, C., Spillane, N.: High perfor- mance domain decomposition methods on massively parallel architectures with FreeFem++. J. Numer. Math. 20(3–4), 287–302 (2012). doi:10.1515/jnum-2012-0015

    work page doi:10.1515/jnum-2012-0015 2012

  14. [14]

    Hecht, F.: New Developments in FreeFem++. J. Numer. Math. 20(3–4), 251–265 (2012). doi:10.1515/jnum-2012-0013

    work page doi:10.1515/jnum-2012-0013 2012

  15. [15]

    E., Zampini, S.: KSPHPDDM and PCHPDDM: Extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners

    Jolivet, P., Roman, J. E., Zampini, S.: KSPHPDDM and PCHPDDM: Extending PETSc with advanced Krylov methods and robust multilevel overlapping Schwarz preconditioners. Comput. Math. Appl. 84, 277–295 (2021)

    2021

  16. [16]

    Karypis, G., Kumar, V.: A fast and high-quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998). 44

    1998

  17. [17]

    Nataf, F., Xiang, H., Dolean, V., Spillane, N.: A coarse space construction based on local Dirichlet-to-Neumann maps. SIAM J. Sci. Comput. 33(4), 1623–1642 (2011). doi:10.1137/100796376

    work page doi:10.1137/100796376 2011

  18. [18]

    Nicolaides, R.A.: Deflation of conjugate gradients with applications to boundary value problems. SIAM J. Numer. Anal. 24(2), 355–365 (1987)

    1987

  19. [19]

    Operto, S., Amestoy, P., Aghamiry, H.S., Beller, S., Buttari, A., Combe, L., Dolean, V., Gerest, M., Guo, G., Jolivet, P., L’Excellent, J.-Y., Mamfoumbi, F., Mary, T., Puglisi, C., Ribodetti, A., Tournier, P.-H.: Is 3D frequency-domain full-waveform inversion of full- azimuth/long-offset OBN data feasible? The Gorgon-data FWI case study. Lead. Edge 42 (2023)

    2023

  20. [20]

    Saad, Y., Schultz, M.H.: GMRES: A generalized minimal residual algorithm for solv- ing nonsymmetric linear systems. SIAM J. Sci. Stat. Comput. 7(3), 856–869 (1986). doi:10.1137/0907058

    work page doi:10.1137/0907058 1986

  21. [21]

    Society for Industrial and Applied Mathematics, Philadelphia (2003)

    Saad, Y: Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia (2003)

    2003

  22. [22]

    Spillane, N., Dolean, V., Nataf, F., Pechstein, C., Scheichl, R.: Abstract robust coarse spaces for systems of PDEs via generalized eigenproblems in the overlaps. Numer. Math. 126(4), 741–770 (2014)

    2014

  23. [23]

    Springer Ser

    Toselli, A., Widlund, O.: Domain decomposition methods—Algorithms and theory . Springer Ser. Comput. Math., vol. 34. Springer, Berlin (2005)

    2005

  24. [24]

    IEEE Antennas Propag

    Tournier, P.-H., Bonazzoli, M., Dolean, V., Rapetti, F., Hecht, F., Nataf, F., Aliferis, I., El Kanfoud, I., Migliaccio, C., de Buhan, M., Darbas, M., Semenov, S., Pichot, C.: Nu- merical modeling and high-speed parallel computing: New perspectives on tomographic microwave imaging for brain stroke detection and monitoring. IEEE Antennas Propag. Mag. 59(5)...

    work page doi:10.1109/map.2017.2731199 2017

  25. [25]

    Geophysics (2022)

    Tournier, P.-H., Jolivet, P., Dolean, V., Aghamiry, H.S., Operto, S., Riffo, S.: Three- dimensional finite-difference finite-element frequency-domain wave simulation with multi- level optimized additive Schwarz domain decomposition preconditioner: A tool for FWI of sparse node datasets. Geophysics (2022). doi:10.1190/geo2021-0702.1 45

    work page doi:10.1190/geo2021-0702.1 2022