[{"data":1,"prerenderedAt":449},["ShallowReactive",2],{"project:dependent-bterms":3,"catalog":32},{"slug":4,"name":5,"nameHtml":5,"summary":6,"summaryHtml":6,"authors":7,"searchText":11,"facets":12,"source":25,"docs":27,"descriptionHtml":28,"bibliographyHtml":29,"funding":30,"affiliations":31},"dependent-bterms","dependent_bterms","SageMath tools for asymptotic expansions with explicit error bounds and a secondary variable whose growth depends on the main variable.",[8],{"name":9,"orcid":10,"html":9},"Benjamin Hackl","https:\u002F\u002Forcid.org\u002F0000-0003-2998-9599","dependent_bterms sagemath tools for asymptotic expansions with explicit error bounds and a secondary variable whose growth depends on the main variable. benjamin hackl dependent_bterms extends sagemath's asymptoticring framework with a secondary symbolic variable whose growth is bounded by powers of the main asymptotic variable. this supports computations in which, for example, 1 \\leq k \\leq n^{1\u002F2} while n tends to infinity. the toolbox combines asymptotic expansions with explicit error bounds. it provides operations for simplifying expansions, rounding error-bound coefficients, changing the range of validity of bounds, and constructing taylor expansions with explicit remainders. a demonstration notebook introduces the package's capabilities. the individual functions include sagemath examples in their docstrings.",{"tags":13,"audiences":16,"affiliations":18,"license":19,"maintenance":21,"resources":23},[14,15],"asymptotic analysis","symbolic computation",[17],"research",[],[20],"GPL-3.0-or-later",[22],"active",[24],"documentation",{"url":26},"https:\u002F\u002Fgithub.com\u002Fbehackl\u002Fdependent_bterms","https:\u002F\u002Fgithub.com\u002Fbehackl\u002Fdependent_bterms\u002Fblob\u002Fmain\u002FREADME.md","\u003Cp>\u003Ccode>dependent_bterms\u003C\u002Fcode> extends SageMath's \u003Ccode>AsymptoticRing\u003C\u002Fcode> framework with a\nsecondary symbolic variable whose growth is bounded by powers of the main\nasymptotic variable. This supports computations in which, for example,\n\u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\">\u003Csvg aria-label=\"1 \\leq k \\leq n^{1\u002F2}\" style=\"vertical-align: -0.566ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"1.131ex\" height=\"2.262ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -750 500 1000\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"1 \\leq k \\leq n^{1\u002F2}\">\u003Cg data-mml-node=\"mn\" data-latex=\"1\">\u003Cpath data-c=\"31\" d=\"M269 666C228 624 168 603 89 603L89 564C141 564 184 572 217 588L217 82C217 64 213 52 204 47C195 42 170 39 130 39L95 39L95 0C120 2 174 3 257 3C340 3 394 2 419 0L419 39L384 39C343 39 318 42 310 47C302 52 297 64 297 82L297 636C297 660 295 666 269 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cmjx-break size=\"4\"> \u003C\u002Fmjx-break>\u003Csvg style=\"vertical-align: -0.566ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"3.567ex\" height=\"2.262ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -750 1576.8 1000\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"1 \\leq k \\leq n^{1\u002F2}\">\u003Cg data-mml-node=\"mo\" data-latex=\"\\leq\">\u003Cpath data-c=\"2264\" d=\"M668 38C686 29 703 44 703 60C703 69 698 76 689 80L155 333L689 586C698 590 703 597 703 606C703 623 695 631 679 631C675 631 671 630 668 629L94 357C84 352 79 344 79 333C79 322 84 315 94 310M678-72L100-72C84-72 76-80 76-95C76-111 84-119 100-119L678-119C694-119 702-111 702-95C702-83 691-72 678-72Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mi\" data-latex=\"k\" transform=\"translate(1055.8,0)\">\u003Cpath data-c=\"1D458\" d=\"M409 353C409 327 423 314 450 314C485 314 508 345 508 379C508 418 476 445 437 445C392 445 344 415 291 356C250 311 217 282 190 269L291 679C289 688 287 694 274 694C242 694 166 685 154 684C139 682 132 675 132 660C132 650 141 645 159 645C178 645 204 646 204 632L59 43C56 32 55 25 55 21C55 0 66-11 87-11C104-11 117-3 124 12C129 21 147 92 179 226C231 221 286 196 286 146C286 131 279 101 279 91C279 34 316-11 373-11C431-11 470 41 490 145C490 154 485 159 475 159C466 159 460 152 457 138C435 59 408 19 375 19C357 19 348 33 348 61C348 77 360 131 360 147C360 204 314 239 221 253C244 269 270 292 298 322C326 352 346 371 359 382C386 404 412 415 435 415C445 415 453 413 459 409C432 404 409 379 409 353Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003Cmjx-break size=\"4\"> \u003C\u002Fmjx-break>\u003Csvg style=\"vertical-align: -0.566ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"6.334ex\" height=\"2.587ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -893.3 2799.4 1143.3\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"1 \\leq k \\leq n^{1\u002F2}\">\u003Cg data-mml-node=\"mo\" data-latex=\"\\leq\">\u003Cpath data-c=\"2264\" d=\"M668 38C686 29 703 44 703 60C703 69 698 76 689 80L155 333L689 586C698 590 703 597 703 606C703 623 695 631 679 631C675 631 671 630 668 629L94 357C84 352 79 344 79 333C79 322 84 315 94 310M678-72L100-72C84-72 76-80 76-95C76-111 84-119 100-119L678-119C694-119 702-111 702-95C702-83 691-72 678-72Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"msup\" data-latex=\"n^{1\u002F2}\" transform=\"translate(1055.8,0)\">\u003Cg data-mml-node=\"mi\" data-latex=\"n\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"TeXAtom\" transform=\"translate(633,363) scale(0.707)\" data-latex=\"{1\u002F2}\" data-mjx-texclass=\"ORD\">\u003Cg data-mml-node=\"mn\" data-latex=\"1\">\u003Cpath data-c=\"31\" d=\"M269 666C228 624 168 603 89 603L89 564C141 564 184 572 217 588L217 82C217 64 213 52 204 47C195 42 170 39 130 39L95 39L95 0C120 2 174 3 257 3C340 3 394 2 419 0L419 39L384 39C343 39 318 42 310 47C302 52 297 64 297 82L297 636C297 660 295 666 269 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mo\" data-latex=\"\u002F\" transform=\"translate(500,0)\">\u003Cpath data-c=\"2F\" d=\"M444 718C445 720 445 723 445 726C445 742 437 750 421 750C410 750 403 745 399 734L57-218C56-220 56-223 56-226C56-242 64-250 80-250C91-250 98-245 102-234Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003Cg data-mml-node=\"mn\" data-latex=\"2\" transform=\"translate(1000,0)\">\u003Cpath data-c=\"32\" d=\"M237 666C186 666 143 648 106 612C69 576 50 534 50 483C50 449 75 424 106 424C136 424 161 450 161 480C161 513 137 536 105 536C102 536 100 536 98 535C117 584 161 627 224 627C306 627 352 556 352 470C352 403 318 331 250 255L62 43C49 28 50 29 50 0L421 0L450 180L417 180C409 129 402 100 396 91C391 86 361 84 306 84L139 84L236 179C304 243 390 312 419 365C439 400 449 435 449 470C449 588 357 666 237 666Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container> while \u003Cmjx-container class=\"MathJax\" jax=\"SVG\" overflow=\"overflow\">\u003Csvg aria-label=\"n\" style=\"vertical-align: -0.025ex;\" xmlns=\"http:\u002F\u002Fwww.w3.org\u002F2000\u002Fsvg\" width=\"1.357ex\" height=\"1.025ex\" role=\"img\" focusable=\"false\" viewBox=\"0 -442 600 453\">\u003Cg stroke=\"currentColor\" fill=\"currentColor\" stroke-width=\"0\" transform=\"scale(1,-1)\">\u003Cg data-mml-node=\"math\" data-latex=\"n\">\u003Cg data-mml-node=\"mi\" data-latex=\"n\">\u003Cpath data-c=\"1D45B\" d=\"M537 137C514 58 481 18 440 18C427 18 420 28 420 47C420 61 426 84 438 115C478 224 498 296 498 333C498 403 451 442 381 442C322 442 271 416 230 363C222 407 187 442 136 442C80 442 58 390 44 345C34 313 29 294 29 287C29 278 34 273 45 273C50 273 53 274 56 276C61 285 64 292 65 299C83 375 106 413 133 413C151 413 160 399 160 371C160 358 155 331 144 290L87 63C84 50 78 24 78 19C78-1 89-11 111-11C130-11 144-1 151 19C153 24 159 49 170 92L191 181L221 295C232 318 249 341 270 365C299 397 335 413 378 413C411 413 427 391 427 348C427 310 406 234 363 120C356 102 353 87 353 74C353 25 390-11 438-11C482-11 517 14 542 64C561 104 571 131 571 144C571 153 566 158 555 158C552 158 537 149 537 137Z\">\u003C\u002Fpath>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fg>\u003C\u002Fsvg>\u003C\u002Fmjx-container> tends to infinity.\u003C\u002Fp>\n\u003Cp>The toolbox combines asymptotic expansions with explicit error bounds. It\nprovides operations for simplifying expansions, rounding error-bound\ncoefficients, changing the range of validity of bounds, and constructing Taylor\nexpansions with explicit remainders.\u003C\u002Fp>\n\u003Cp>A \u003Ca href=\"https:\u002F\u002Fgithub.com\u002Fbehackl\u002Fdependent_bterms\u002Fblob\u002Fmain\u002Ftoolbox_demo.ipynb\">demonstration notebook\u003C\u002Fa>\nintroduces the package's capabilities. The individual functions include\nSageMath examples in their docstrings.\u003C\u002Fp>","",[],[],{"version":33,"projects":34,"facets":392},1,[35,64,81,96,117,135,145,167,186,202,221,236,259,278,299,317,332,349,379],{"slug":36,"name":37,"nameHtml":37,"summary":38,"summaryHtml":38,"authors":39,"searchText":50,"facets":51},"avionic","AVIONIC","GPU-accelerated variational reconstruction of undersampled dynamic MRI data, including estimation of receiver-coil sensitivities.",[40,42,45,47],{"name":41,"html":41},"Andreas Schwarzl",{"name":43,"orcid":44,"html":43},"Martin Holler","https:\u002F\u002Forcid.org\u002F0000-0002-2895-2375",{"name":46,"html":46},"Matthias Schloegl",{"name":48,"orcid":49,"html":48},"Kristian Bredies","https:\u002F\u002Forcid.org\u002F0000-0001-7140-043X","avionic gpu-accelerated variational reconstruction of undersampled dynamic mri data, including estimation of receiver-coil sensitivities. andreas schwarzl martin holler matthias schloegl kristian bredies avionic — accelerated variational dynamic mri reconstruction implements gpu-accelerated reconstruction of highly undersampled dynamic magnetic resonance measurements. applications include cardiac imaging and dynamic contrast-enhanced mri. the software supports cartesian and non-cartesian sampling when the required trajectory information is available. it also includes variational estimation of receiver-coil sensitivity profiles and reconstruction methods based on infimal convolution of total generalized variation functionals. the primary repository is hosted on tu graz gitlab. the older github repository is archived and points to that location; the mirror's archival status does not imply that development of the software has ended. the readme and bundled license file give different gpl\u002Flgpl notices. consult the repository's licensing information before reuse.",{"tags":52,"audiences":57,"affiliations":58,"license":59,"maintenance":61,"resources":62},[53,54,55,56],"inverse problems","mathematical imaging","magnetic resonance imaging","GPU computing",[17],[],[60],"unspecified",[60],[24,63],"publications",{"slug":65,"name":66,"nameHtml":66,"summary":67,"summaryHtml":67,"authors":68,"searchText":71,"facets":72},"cellsim","CellSim","Julia simulation code for cell mechanics in confined environments, with configurable cortex, nucleus, and confinement models.",[69],{"name":70,"html":70},"Gaspard Jankowiak","cellsim julia simulation code for cell mechanics in confined environments, with configurable cortex, nucleus, and confinement models. gaspard jankowiak cellsim is a julia codebase for numerical simulations of cell mechanics. its modules represent the cell cortex, nucleus, centrosome, and confining walls, with utilities for plotting and measuring simulation results. yaml configuration files control parameters such as membrane elasticity, cortex viscosity, polymerization speed, confinement geometry, and nuclear mechanics. the repository includes configurations with and without a nucleus, parameter sweeps, and scripts for collecting and plotting metrics. this is a research simulation codebase rather than a registered julia package. the readme provides environment setup and execution instructions; users should check its dependency requirements before running the examples.",{"tags":73,"audiences":76,"affiliations":77,"license":78,"maintenance":79,"resources":80},[74,75],"mathematical biology","numerical simulation",[17],[],[60],[60],[24],{"slug":82,"name":82,"nameHtml":82,"summary":83,"summaryHtml":83,"authors":84,"searchText":86,"facets":87},"combpyter","A lightweight Python library for enumerating Dyck paths and studying their combinatorial statistics.",[85],{"name":9,"orcid":10,"html":9},"combpyter a lightweight python library for enumerating dyck paths and studying their combinatorial statistics. benjamin hackl combpyter is a lightweight python library for generating and analysing combinatorial objects. it is a personal, research-driven project with a focused scope: the documented implementation currently supports dyck paths through the dyckpath and dyckpaths interfaces. the readme demonstrates enumerating dyck paths of semilength 8 and computing the distribution of their numbers of peaks. this statistic is described by the narayana numbers n(n,k) = \\frac{1}{n}\\binom{n}{k}\\binom{n}{k-1}. the package is installable from pypi and includes tests in its source repository.",{"tags":88,"audiences":90,"affiliations":91,"license":92,"maintenance":94,"resources":95},[89],"enumerative combinatorics",[17],[],[93],"MIT",[60],[24],{"slug":97,"name":98,"nameHtml":98,"summary":99,"summaryHtml":99,"authors":100,"searchText":107,"facets":108},"coupled-tgv-recon","coupled_tgv_recon","MATLAB algorithms for coupled multichannel image reconstruction, including joint magnetic resonance and positron emission tomography reconstruction.",[101,103,104,105],{"name":102,"html":102},"Florian Knoll",{"name":43,"orcid":44,"html":43},{"name":48,"orcid":49,"html":48},{"name":106,"html":106},"Thomas Koesters","coupled_tgv_recon matlab algorithms for coupled multichannel image reconstruction, including joint magnetic resonance and positron emission tomography reconstruction. florian knoll martin holler kristian bredies thomas koesters coupled_tgv_recon provides matlab code for multichannel regularized image reconstruction using coupled total generalized variation. applications include multi-contrast denoising and joint reconstruction of magnetic resonance (mr) and positron emission tomography (pet) measurements. the repository contains a reconstruction algorithm, a control script, and example data and operators. its examples range from a digital brain phantom to an in-vivo mr–pet experiment, for which additional data must be downloaded. the pet examples use emrecon projection operators; some are supplied as compiled matlab extensions. the implementation supports different coupling norms and is designed to be extended to additional datasets and forward operators. the readme documents operator normalization, reconstruction parameters, and platform-specific requirements. the full in-vivo example has substantial memory and runtime requirements.",{"tags":109,"audiences":111,"affiliations":112,"license":113,"maintenance":115,"resources":116},[53,54,55,110],"tomography",[17],[],[114],"GPL-3.0",[60],[24],{"slug":118,"name":119,"nameHtml":119,"summary":120,"summaryHtml":120,"authors":121,"searchText":123,"facets":124},"cyclic-group-zerosum-factor","Exhaustive Search for Minimal Factorizations of Zero-Sum Sequences in Cyclic Groups","A multithreaded Rust program for exhaustive searches for factorizations into four minimal zero-sum sequences in cyclic groups of even order.",[122],{"name":9,"orcid":10,"html":9},"exhaustive search for minimal factorizations of zero-sum sequences in cyclic groups a multithreaded rust program for exhaustive searches for factorizations into four minimal zero-sum sequences in cyclic groups of even order. benjamin hackl this rust program, distributed as cyclic-group-zerosum-factor , carries out exhaustive computational experiments on zero-sum sequences in cyclic groups of even order c_{2n} . for selected generators a,b,c , it investigates whether a sequence of the form u = a^{2n}b^{2n}c^{2n} = u_1u_2u_3u_4 admits a factorization into four non-empty minimal zero-sum sequences. candidate factorizations are enumerated through products of weak integer compositions, with batches of candidates distributed to worker threads. the zenodo archive includes the rust source, cargo metadata, and a readme with the mathematical formulation, implementation notes, and experimental results. the command cargo run --release -- \u003Cn> selects the group order 2n . this is a standalone program, separate from the zero-sum-sequences python package. the license recorded for the deposited software is cc by 4.0.",{"tags":125,"audiences":129,"affiliations":130,"license":131,"maintenance":133,"resources":134},[126,127,128],"additive combinatorics","factorization theory","exhaustive search",[17],[],[132],"CC-BY-4.0",[60],[],{"slug":4,"name":5,"nameHtml":5,"summary":6,"summaryHtml":6,"authors":136,"searchText":11,"facets":138},[137],{"name":9,"orcid":10,"html":9},{"tags":139,"audiences":140,"affiliations":141,"license":142,"maintenance":143,"resources":144},[14,15],[17],[],[20],[22],[24],{"slug":146,"name":147,"nameHtml":147,"summary":148,"summaryHtml":148,"authors":149,"searchText":157,"facets":158},"gpdps","GPDPS.jl","A Julia reference implementation of generalized primal-dual proximal splitting for nonsmooth, nonconvex optimization.",[150,153,155],{"name":151,"orcid":152,"html":151},"Christian Clason","https:\u002F\u002Forcid.org\u002F0000-0002-9948-8426",{"name":154,"html":154},"Stanislav Mazurenko",{"name":156,"html":156},"Tuomo Valkonen","gpdps.jl a julia reference implementation of generalized primal-dual proximal splitting for nonsmooth, nonconvex optimization. christian clason stanislav mazurenko tuomo valkonen gpdps.jl provides the reference implementation of a generalized primal-dual proximal splitting approach based on generalized conjugation. it accompanies research on nonsmooth, nonconvex optimization. the package includes examples for an elliptic nash equilibrium problem and a huber–potts image segmentation model. the latter supports isotropic and anisotropic variants and configurable images and regularization parameters. the documented test environment uses julia 1.0–1.2 on macos and linux. the repository supplies a project environment and instructions for instantiating its dependencies; compatibility with newer julia versions should be checked before use.",{"tags":159,"audiences":162,"affiliations":163,"license":164,"maintenance":165,"resources":166},[160,161,54],"numerical optimization","nonsmooth optimization",[17],[],[93],[60],[24,63],{"slug":168,"name":169,"nameHtml":169,"summary":170,"summaryHtml":170,"authors":171,"searchText":177,"facets":178},"graptor","Graptor","GPU-accelerated tomographic reconstruction with variational regularization, including joint reconstruction of complementary electron microscopy channels.",[172,175,176],{"name":173,"orcid":174,"html":173},"Richard Huber","https:\u002F\u002Forcid.org\u002F0000-0003-1743-6786",{"name":43,"orcid":44,"html":43},{"name":48,"orcid":49,"html":48},"graptor gpu-accelerated tomographic reconstruction with variational regularization, including joint reconstruction of complementary electron microscopy channels. richard huber martin holler kristian bredies graptor — graz application for tomographic reconstruction reconstructs images from radon-transform data using iterative variational methods and multi-channel total generalized variation regularization. a particular focus is joint reconstruction of complementary channels, originally haadf and edx measurements in scanning transmission electron tomography. the opencl\u002Fgpu implementation is accompanied by a graphical user interface, preprocessing options, and a command-line reconstruction script. the project originated in a collaboration between mathematics at the university of graz and electron microscopy and nanoanalysis at graz university of technology. the repository includes phantom data and commands for reproducing the numerical results of the associated publication.",{"tags":179,"audiences":181,"affiliations":182,"license":183,"maintenance":184,"resources":185},[110,53,180,56],"numerical analysis",[17],[],[20],[60],[24,63],{"slug":187,"name":188,"nameHtml":188,"summary":189,"summaryHtml":189,"authors":190,"searchText":194,"facets":195},"gratopy","Gratopy","OpenCL-accelerated Radon and fanbeam projections, backprojections, and iterative tomographic reconstruction methods for Python.",[191,192,193],{"name":48,"orcid":49,"html":48},{"name":173,"orcid":174,"html":173},{"name":9,"orcid":10,"html":9},"gratopy opencl-accelerated radon and fanbeam projections, backprojections, and iterative tomographic reconstruction methods for python. kristian bredies richard huber benjamin hackl gratopy — graz accelerated tomographic projections for python provides radon transforms, fanbeam transforms, and their associated backprojections. its pixel-driven projection operators are implemented with opencl for efficient gpu execution and integration with other pyopencl code. the toolbox is intended for developing iterative tomographic reconstruction methods, including optimization-based approaches. it includes landweber, conjugate-gradient, and total-variation reconstruction schemes, together with examples and test data. an experimental radon operator interface supports adjoints and compositions such as r^\\ast r . fanbeam execution remains available through the established projection interface. opencl drivers and a suitable pyopencl installation are required.",{"tags":196,"audiences":197,"affiliations":198,"license":199,"maintenance":200,"resources":201},[110,53,180,56],[17],[],[20],[22],[24,63],{"slug":203,"name":204,"nameHtml":204,"summary":205,"summaryHtml":205,"authors":206,"authorsNote":208,"authorsNoteHtml":208,"searchText":209,"facets":210},"manim","Manim","A community-developed Python library for creating precise mathematical animations programmatically, for explanatory videos, teaching, and presentations.",[207],{"name":9,"orcid":10,"html":9},"and the Manim community","manim a community-developed python library for creating precise mathematical animations programmatically, for explanatory videos, teaching, and presentations. benjamin hackl and the manim community manim community is a python library for creating mathematical animations programmatically. scenes are defined in python and rendered into videos, making it possible to build precise, reproducible visual explanations for teaching, presentations, and science communication. this entry refers to the community edition, which was forked from the animation tool originally created by grant sanderson for 3blue1brown. it is developed by an international community; the author list here highlights a department member rather than attempting to list all contributors. manim can be used from the command line or within jupyter notebooks. the documentation includes installation instructions, tutorials, and an example gallery. an online jupyter environment lets users try it without a local installation.",{"tags":211,"audiences":214,"affiliations":217,"license":218,"maintenance":219,"resources":220},[212,213],"mathematical visualization","animation",[215,216],"teaching","science communication",[],[93],[22],[24],{"slug":222,"name":222,"nameHtml":222,"summary":223,"summaryHtml":223,"authors":224,"searchText":227,"facets":228},"nlpdegm","MATLAB reference implementations of primal-dual extragradient methods for nonlinear, nonsmooth PDE-constrained optimization.",[225,226],{"name":151,"orcid":152,"html":151},{"name":156,"html":156},"nlpdegm matlab reference implementations of primal-dual extragradient methods for nonlinear, nonsmooth pde-constrained optimization. christian clason tuomo valkonen nlpdegm provides matlab reference implementations for primal-dual extragradient methods applied to nonlinear, nonsmooth pde-constrained optimization. it accompanies the research article by christian clason and tuomo valkonen. the repository contains finite-element setup code and implementations for l^1 fitting, l^\\infty fitting, and state-constrained problems. it is paper-specific research code rather than a general-purpose optimization package.",{"tags":229,"audiences":231,"affiliations":232,"license":233,"maintenance":234,"resources":235},[161,230,160],"optimal control",[17],[],[60],[60],[24,63],{"slug":237,"name":238,"nameHtml":238,"summary":239,"summaryHtml":239,"authors":240,"searchText":250,"facets":251},"sage-acsv","sage_acsv","SageMath algorithms for computing asymptotics of multivariate sequences with rational generating functions, using exact algebraic computations.",[241,242,244,246,248],{"name":9,"orcid":10,"html":9},{"name":243,"html":243},"Andrew Luo",{"name":245,"html":245},"Stephen Melczer",{"name":247,"html":247},"Jesse Selover",{"name":249,"html":249},"Elaine Wong","sage_acsv sagemath algorithms for computing asymptotics of multivariate sequences with rational generating functions, using exact algebraic computations. benjamin hackl andrew luo stephen melczer jesse selover elaine wong sage_acsv implements algorithms for analytic combinatorics in several variables in sagemath. it computes asymptotic information about multivariate sequences with rational generating functions, using exact algebraic computations. for generating functions of the form f(\\mathbf{z}) = \\frac{g(\\mathbf{z})}{h(\\mathbf{z})}, the geometry of the singular variety h(\\mathbf{z})=0 is central to the asymptotic analysis. the package's original algorithms treat smooth cases; subsequent work extends the implementation to non-smooth singular varieties under additional geometric assumptions, using whitney stratification. further capabilities include higher-order asymptotic expansions and alternative backends for algebraic computations. documentation and examples are available online, and the package can be explored through binder .",{"tags":252,"audiences":254,"affiliations":255,"license":256,"maintenance":257,"resources":258},[253,14,15],"analytic combinatorics",[17],[],[93],[22],[24,63],{"slug":260,"name":261,"nameHtml":261,"summary":262,"summaryHtml":262,"authors":263,"searchText":269,"facets":270},"sagemath-asymptotic-ring","SageMath Asymptotic Ring","Symbolic arithmetic with univariate and multivariate asymptotic expansions, including polynomial, logarithmic, and exponential growth.",[264,265,267],{"name":9,"orcid":10,"html":9},{"name":266,"html":266},"Daniel Krenn",{"name":268,"html":268},"Clemens Heuberger","sagemath asymptotic ring symbolic arithmetic with univariate and multivariate asymptotic expansions, including polynomial, logarithmic, and exponential growth. benjamin hackl daniel krenn clemens heuberger sagemath's asymptotic ring provides a framework for symbolic asymptotic expansions. it combines growth groups with coefficient rings and supports arithmetic with exact terms and asymptotic error terms in one or several variables. the framework handles polynomial, logarithmic, and exponential growth and provides operations such as multiplication, powers, logarithms, and exponentials of expansions. the sagemath reference manual contains extensive worked examples and describes the available growth groups and term types. this entry concerns the asymptotic-expansion component of sagemath, not the whole computer algebra system. it is distributed as part of sagemath and is distinct from the separate dependent_bterms extension for explicit error bounds with a dependent secondary variable.",{"tags":271,"audiences":272,"affiliations":273,"license":274,"maintenance":276,"resources":277},[14,15],[17],[],[275],"GPL-2.0-or-later",[22],[24],{"slug":279,"name":280,"nameHtml":280,"summary":281,"summaryHtml":281,"authors":282,"searchText":289,"facets":290},"sagemath-banff-cluster-algebras-and-finite-laurent-intersection-rings","Banff cluster algebras and finite Laurent intersection rings in SageMath","SageMath classes for finite Laurent intersection rings (FLIRs) and Banff cluster algebras, with algorithms for membership testing, divisor\u002Fclass group computation, and factorization.",[283,286],{"name":284,"orcid":285,"html":284},"Mara Pompili","https:\u002F\u002Forcid.org\u002F0000-0003-0681-7241",{"name":287,"orcid":288,"html":287},"Daniel Smertnig","https:\u002F\u002Forcid.org\u002F0000-0002-5391-2471","banff cluster algebras and finite laurent intersection rings in sagemath sagemath classes for finite laurent intersection rings (flirs) and banff cluster algebras, with algorithms for membership testing, divisor\u002Fclass group computation, and factorization. mara pompili daniel smertnig this sagemath extension adds two new algebra classes: finitelaurentintersectionring — a finite intersection of laurent polynomial rings together with birational change-of-charts data, providing divisor groups, prime divisors, and class group computations. banffclusteralgebra — a banff (locally acyclic) cluster algebra realized both as a cluster algebra and as a finite laurent intersection ring, giving effective algorithms for membership, divisor groups, class groups, and factorization. these implement the algorithms of pompili and smertnig (2026) , who introduced flirs as a class of rings that contains locally acyclic cluster algebras, full-rank upper cluster algebras, and several other families. the class-group and factoriality algorithms use multivariate polynomial factorization and avoid expensive grobner basis calculations. the code is being added to sagemath via pr #42538 (work in progress) and is licensed under the gnu gpl v2 or later, in line with the rest of sagemath.",{"tags":291,"audiences":294,"affiliations":295,"license":296,"maintenance":297,"resources":298},[292,293,127,15],"cluster algebras","commutative algebra",[17],[],[275],[22],[63],{"slug":300,"name":301,"nameHtml":301,"summary":302,"summaryHtml":302,"authors":303,"searchText":308,"facets":309},"solvopt","SolvOpt","A historical solver for local nonlinear and nonsmooth optimization, distributed with MATLAB, C, and Fortran implementations.",[304,306],{"name":305,"html":305},"Alexei Kuntsevich",{"name":307,"html":307},"Franz Kappel","solvopt a historical solver for local nonlinear and nonsmooth optimization, distributed with matlab, c, and fortran implementations. alexei kuntsevich franz kappel solvopt — solver for local nonlinear optimization problems is a historical university of graz optimization package by alexei kuntsevich and franz kappel. it uses a modified version of shor's r-algorithm for local optimization of nonlinear, potentially nonsmooth functions and supports constrained problems. the department's download site preserves version 1.1, released in june 1997, with matlab, c, and fortran source distributions, test problems, demonstration code, and a detailed manual. this entry records that historical distribution and is marked archived under the directory's pre-2015 update policy. the original installation instructions target much older compiler and matlab environments. compatibility with current systems is not implied. the manual describes the software as freeware; consult its original terms before reuse.",{"tags":310,"audiences":311,"affiliations":312,"license":313,"maintenance":314,"resources":316},[161,160],[17],[],[60],[315],"archived",[24],{"slug":318,"name":319,"nameHtml":319,"summary":320,"summaryHtml":320,"authors":321,"searchText":323,"facets":324},"tgv-pycuda","tgv_pycuda","GPU-accelerated TV and TGV methods for denoising, deblurring, upscaling, dequantization, and compressive imaging in Python.",[322],{"name":48,"orcid":49,"html":48},"tgv_pycuda gpu-accelerated tv and tgv methods for denoising, deblurring, upscaling, dequantization, and compressive imaging in python. kristian bredies tgv_pycuda implements primal-dual algorithms for imaging problems regularized by total variation (tv) and second-order total generalized variation (tgv). the python implementation uses pycuda for gpu acceleration and requires a cuda-capable gpu and a working cuda installation. the repository includes algorithms, tests, and examples for denoising, deblurring, zooming, dequantization, and compressive imaging. a guided jupyter notebook reproduces figures and numerical experiments from the associated publication on recovering piecewise smooth multichannel images.",{"tags":325,"audiences":326,"affiliations":327,"license":328,"maintenance":330,"resources":331},[53,54,160,56],[17],[],[329],"Apache-2.0",[60],[24,63],{"slug":333,"name":333,"nameHtml":333,"summary":334,"summaryHtml":334,"authors":335,"searchText":341,"facets":342},"vectormultibang","MATLAB implementations of convex relaxation for discrete vector-valued optimization, with examples in optimal control and branched transport.",[336,337,339],{"name":151,"orcid":152,"html":151},{"name":338,"html":338},"Carla Tameling",{"name":340,"html":340},"Benedikt Wirth","vectormultibang matlab implementations of convex relaxation for discrete vector-valued optimization, with examples in optimal control and branched transport. christian clason carla tameling benedikt wirth vectormultibang contains matlab implementations accompanying research on convex relaxation of discrete vector-valued optimization problems. these methods address settings in which admissible controls or material choices are restricted to discrete vectors. three groups of examples cover optimal control of the bloch equation, optimal control of linearized elasticity, and multimaterial branched transport. each has a dedicated test script in the repository.",{"tags":343,"audiences":344,"affiliations":345,"license":346,"maintenance":347,"resources":348},[161,230,160],[17],[],[93],[60],[24,63],{"slug":350,"name":350,"nameHtml":350,"summary":351,"summaryHtml":351,"authors":352,"searchText":367,"facets":368},"vitabel","A Python framework for loading, aligning, visualizing, and interactively annotating physiological time series in Jupyter notebooks.",[353,356,359,360,363,366],{"name":354,"orcid":355,"html":354},"Simon Orlob","https:\u002F\u002Forcid.org\u002F0000-0001-7799-4822",{"name":357,"orcid":358,"html":357},"Wolfgang J. Kern","https:\u002F\u002Forcid.org\u002F0000-0001-5080-382X",{"name":9,"orcid":10,"html":9},{"name":361,"orcid":362,"html":361},"Jan Wnent","https:\u002F\u002Forcid.org\u002F0000-0002-8685-858X",{"name":364,"orcid":365,"html":364},"Jan-Thorsten Gräsner","https:\u002F\u002Forcid.org\u002F0000-0001-8143-0376",{"name":43,"orcid":44,"html":43},"vitabel a python framework for loading, aligning, visualizing, and interactively annotating physiological time series in jupyter notebooks. simon orlob wolfgang j. kern benjamin hackl jan wnent jan-thorsten grasner martin holler vitabel is a python framework for loading, visualizing, aligning, and annotating high-resolution physiological time series in jupyter notebooks. it supports retrospective critical-care and perioperative research workflows involving recordings from defibrillators, anaesthesia systems, and patient monitors. its central vitals container combines channels, labels, and metadata. users can align recordings from multiple sources, add derived labels, and curate data for signal processing, statistics, and machine learning. supported workflows include loading defibrillator recordings and vitaldb data, computing ventilation-related signals, and interactively annotating events. the project provides documentation, worked examples, and an interactive binder demonstration .",{"tags":369,"audiences":374,"affiliations":375,"license":376,"maintenance":377,"resources":378},[370,371,372,373],"medical data","time series","data annotation","machine learning",[17],[],[93],[22],[24,63],{"slug":380,"name":380,"nameHtml":380,"summary":381,"summaryHtml":381,"authors":382,"searchText":384,"facets":385},"zero-sum-sequences","Python tools for factoring finite additive sequences into minimal zero-sum sequences and exploring factorization lengths, relations, and automorphism orbits.",[383],{"name":9,"orcid":10,"html":9},"zero-sum-sequences python tools for factoring finite additive sequences into minimal zero-sum sequences and exploring factorization lengths, relations, and automorphism orbits. benjamin hackl zero-sum-sequences provides immutable finite additive sequences and algorithms for factoring them into minimal zero-sum sequences. it runs in ordinary python with networkx and optionally integrates with additive groups supplied by sagemath. for a sequence over an additive group g , the zero-sum condition is g_1 + \\cdots + g_m = 0. the package computes sets of factorization lengths, minimum and maximum lengths, witnesses, and complete factorizations. it also supports atom catalogues, factorization relations, and automorphism orbits. the ambient group and an upper bound for its davenport constant are supplied explicitly by the caller. for example, over c_3 , the minimal zero-sum sequences a=1^3 , b=2^3 , and p=1\\cdot 2 satisfy the factorization relation ab=p^3 . an executable tutorial introduces the api with small examples; the repository also includes benchmarks.",{"tags":386,"audiences":387,"affiliations":388,"license":389,"maintenance":390,"resources":391},[126,127,15],[17],[],[93],[22],[24],{"tags":393,"audiences":424,"affiliations":429,"license":430,"maintenance":439,"resources":445},[394,396,397,398,400,401,402,403,404,405,406,408,410,411,412,413,414,415,416,417,418,419,420,421,422,423],{"value":126,"label":126,"html":126,"count":395},2,{"value":253,"label":253,"html":253,"count":33},{"value":213,"label":213,"html":213,"count":33},{"value":14,"label":14,"html":14,"count":399},3,{"value":292,"label":292,"html":292,"count":33},{"value":293,"label":293,"html":293,"count":33},{"value":372,"label":372,"html":372,"count":33},{"value":89,"label":89,"html":89,"count":33},{"value":128,"label":128,"html":128,"count":33},{"value":127,"label":127,"html":127,"count":399},{"value":56,"label":56,"html":56,"count":407},4,{"value":53,"label":53,"html":53,"count":409},5,{"value":373,"label":373,"html":373,"count":33},{"value":55,"label":55,"html":55,"count":395},{"value":74,"label":74,"html":74,"count":33},{"value":54,"label":54,"html":54,"count":407},{"value":212,"label":212,"html":212,"count":33},{"value":370,"label":370,"html":370,"count":33},{"value":161,"label":161,"html":161,"count":407},{"value":180,"label":180,"html":180,"count":395},{"value":160,"label":160,"html":160,"count":409},{"value":75,"label":75,"html":75,"count":33},{"value":230,"label":230,"html":230,"count":395},{"value":15,"label":15,"html":15,"count":409},{"value":371,"label":371,"html":371,"count":33},{"value":110,"label":110,"html":110,"count":399},[425,427,428],{"value":17,"label":17,"html":17,"count":426},18,{"value":216,"label":216,"html":216,"count":33},{"value":215,"label":215,"html":215,"count":33},[],[431,432,433,434,435,436,438],{"value":329,"label":329,"html":329,"count":33},{"value":132,"label":132,"html":132,"count":33},{"value":275,"label":275,"html":275,"count":395},{"value":114,"label":114,"html":114,"count":33},{"value":20,"label":20,"html":20,"count":399},{"value":93,"label":93,"html":93,"count":437},7,{"value":60,"label":60,"html":60,"count":407},[440,442,443],{"value":22,"label":22,"html":22,"count":441},8,{"value":315,"label":315,"html":315,"count":33},{"value":60,"label":60,"html":60,"count":444},10,[446,448],{"value":24,"label":24,"html":24,"count":447},17,{"value":63,"label":63,"html":63,"count":444},1789745190577]