assembly ¤
Assembly functions for the transient circuit solver.
Provides functions for evaluating the residual vectors and effective Jacobian of the discretised circuit equations at each Newton iteration. Functions are provided in two variants:
-
Full assembly (:func:
assemble_system_real, :func:assemble_system_complex) — evaluates both the residual and the forward-mode Jacobian viajax.jacfwd. Used once per timestep to assemble and factor the frozen Jacobian in :class:~circulax.solver.FactorizedTransientSolver. -
Residual only (:func:
assemble_residual_only_real, :func:assemble_residual_only_complex) — evaluates only the primal residual, with no Jacobian computation. Used inside the Newton loop where the Jacobian has already been factored and only needs to be applied.
Each pair has a real and a complex variant. The complex variant operates on state vectors in unrolled block format — real parts concatenated with imaginary parts — allowing complex circuit analyses to reuse real-valued sparse linear algebra kernels.
Functions:
| Name | Description |
|---|---|
assemble_gc_complex | Return separate complex G and C COO value arrays at the linearisation point. |
assemble_gc_complex_2n | Return four-block G and C COO value arrays for the 2N×2N real-block system. |
assemble_gc_real | Return separate G and C COO value arrays at the linearisation point. |
assemble_residual_only_complex | Assemble the residual vectors for an unrolled complex system, without computing the Jacobian. |
assemble_residual_only_real | Assemble the residual vectors for a real system, without computing the Jacobian. |
assemble_system_complex | Assemble the residual vectors and effective Jacobian values for an unrolled complex system. |
assemble_system_real | Assemble the residual vectors and effective Jacobian values for a real system. |
assemble_gc_complex ¤
Return separate complex G and C COO value arrays at the linearisation point.
Complex counterpart of :func:assemble_gc_real. The input state vector is in unrolled block format (real parts followed by imaginary parts, shape (2 * num_vars,)). Returns complex128 COO value arrays aligned with the N-sized (not 2N) index arrays from _build_index_arrays(..., is_complex=False), suitable for building an N x N complex admittance matrix in the AC sweep.
The complex Jacobian is recovered from the four real Jacobian blocks via the Wirtinger formula::
J_complex = (1/2)(J_RR + J_II) + (j/2)(J_IR - J_RI)
For holomorphic functions this simplifies to J_RR + j * J_IR; for real-valued functions it reduces to J_RR + 0j.
Source code in circulax/solvers/assembly.py
assemble_gc_complex_2n ¤
Return four-block G and C COO value arrays for the 2N×2N real-block system.
Unlike :func:assemble_gc_complex which collapses the four Jacobian blocks into N×N complex matrices via the Wirtinger formula, this function keeps the blocks separate — returning [RR, RI, IR, II] for both G and C. This is required for circuits containing non-holomorphic operations (e.g. jnp.real()) where the Wirtinger N×N system does not fully capture the conjugate field response.
Returns:
| Type | Description |
|---|---|
list[Array] |
|
list[Array] |
|
tuple[list[Array], list[Array]] | the N-sized index arrays from |
Source code in circulax/solvers/assembly.py
492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 | |
assemble_gc_real ¤
Return separate G and C COO value arrays at the linearisation point.
Mirrors :func:assemble_system_real but returns df/dy (conductance) and dq/dy (capacitance) separately instead of combining them as G + C/dt. Frequency-domain groups contribute zero-filled blocks so that the returned arrays align with the static COO index arrays produced by _build_index_arrays (which includes all groups).
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
y_guess | Array | Linearisation point (DC operating point), shape | required |
component_groups | dict | Compiled component groups from :func: | required |
Returns:
| Type | Description |
|---|---|
Array | A two-tuple |
Array | have the same length as the concatenated |
tuple[Array, Array] | index arrays from |
Source code in circulax/solvers/assembly.py
assemble_residual_only_complex ¤
assemble_residual_only_complex(
y_guess: Array, component_groups: dict, t1: float, dt: float
) -> tuple[Array, Array]
Assemble the residual vectors for an unrolled complex system, without computing the Jacobian.
The complex counterpart of :func:assemble_residual_only_real. The state vector is expected in unrolled block format (real parts followed by imaginary parts) matching the layout used by :func:assemble_system_complex.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
y_guess | Array | Unrolled state vector of shape | required |
component_groups | dict | Compiled component groups returned by :func: | required |
t1 | float | Time at which the system is being evaluated. | required |
dt | float | Unused; present for signature symmetry with :func: | required |
Returns:
| Type | Description |
|---|---|
Array | A two-tuple |
Array |
|
Source code in circulax/solvers/assembly.py
assemble_residual_only_real ¤
assemble_residual_only_real(
y_guess: Array, component_groups: dict, t1: float, dt: float
) -> tuple[Array, Array]
Assemble the residual vectors for a real system, without computing the Jacobian.
Cheaper than :func:assemble_system_real as it performs only primal evaluations. Used inside the frozen-Jacobian Newton loop where the Jacobian has already been factored and only the residual needs to be recomputed at each iteration.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
y_guess | Array | Current state vector of shape | required |
component_groups | dict | Compiled component groups returned by :func: | required |
t1 | float | Time at which the system is being evaluated. | required |
dt | float | Unused; present for signature symmetry with :func: | required |
Returns:
| Type | Description |
|---|---|
Array | A two-tuple |
Array |
|
Source code in circulax/solvers/assembly.py
assemble_system_complex ¤
assemble_system_complex(
y_guess: Array,
component_groups: dict,
t1: float,
dt: float,
source_scale: float = 1.0,
alpha: float = 1.0,
) -> tuple[Array, Array, Array]
Assemble the residual vectors and effective Jacobian values for an unrolled complex system.
The complex state vector is stored in unrolled (block) format: the first half of y_guess holds the real parts of all node voltages/states, the second half holds the imaginary parts. This avoids JAX's limited support for complex-valued sparse linear solvers by keeping all arithmetic real.
The Jacobian is split into four real blocks — RR, RI, IR, II — representing the partial derivatives of the real and imaginary residual components with respect to the real and imaginary state components respectively. The blocks are concatenated in RR→RI→IR→II order to match the sparsity index layout produced during compilation.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
y_guess | Array | Unrolled state vector of shape | required |
component_groups | dict | Compiled component groups returned by :func: | required |
t1 | float | Time at which the system is being evaluated. | required |
dt | float | Timestep duration, used to scale the reactive Jacobian blocks. | required |
source_scale | float | Multiplicative scale applied to source amplitudes (components whose | 1.0 |
alpha | float | Jacobian scaling factor for the reactive blocks. Use | 1.0 |
Returns:
| Type | Description |
|---|---|
Array | A three-tuple |
Array |
|
Array |
|
tuple[Array, Array, Array] |
|
Source code in circulax/solvers/assembly.py
638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 | |
assemble_system_real ¤
assemble_system_real(
y_guess: Array,
component_groups: dict,
t1: float,
dt: float,
source_scale: float = 1.0,
alpha: float = 1.0,
) -> tuple[Array, Array, Array]
Assemble the residual vectors and effective Jacobian values for a real system.
For each component group, evaluates the physics at t1 and computes the forward-mode Jacobian via jax.jacfwd. The effective Jacobian combines the resistive and reactive contributions as J_eff = df/dy + (alpha/dt) * dq/dy, where alpha=1 recovers Backward Euler and alpha=3/2 (uniform step) gives BDF2.
Components are processed in sorted key order to ensure a deterministic non-zero layout in the sparse Jacobian, which is required for the factorisation step.
Parameters:
| Name | Type | Description | Default |
|---|---|---|---|
y_guess | Array | Current state vector of shape | required |
component_groups | dict | Compiled component groups returned by :func: | required |
t1 | float | Time at which the system is being evaluated. | required |
dt | float | Timestep duration, used to scale the reactive Jacobian block. | required |
source_scale | float | Multiplicative scale applied to source amplitudes (components whose | 1.0 |
alpha | float | Jacobian scaling factor for the reactive block. Use | 1.0 |
Returns:
| Type | Description |
|---|---|
Array | A three-tuple |
Array |
|
Array |
|
tuple[Array, Array, Array] |
|
Source code in circulax/solvers/assembly.py
261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 | |