default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBraxton Osting
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j32]Chiu-Yen Kao, Junshan Lin, Braxton Osting:
A semi-definite optimization method for maximizing the shared band gap of topological photonic crystals. J. Comput. Phys. 521: 113538 (2025)- 2024
- [j31]Zachary M. Boyd
, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting:
An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs. SIAM J. Matrix Anal. Appl. 45(1): 685-711 (2024) - [i20]Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola, Peter J. Mucha, Braxton Osting:
Targeting influence in a harmonic opinion model. CoRR abs/2407.00213 (2024) - 2023
- [j30]Chiu-Yen Kao, Braxton Osting, Jackson C. Turner:
Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight. SIAM J. Appl. Algebra Geom. 7(1): 172-193 (2023) - [j29]Braxton Osting:
Extremal Graph Realizations and Graph Laplacian Eigenvalues. SIAM J. Discret. Math. 37(3): 1630-1644 (2023) - [j28]Chiu-Yen Kao, Braxton Osting, Édouard Oudet:
Harmonic Functions on Finitely Connected Tori. SIAM J. Numer. Anal. 61(6): 2795-2812 (2023) - [i19]Chiu-Yen Kao, Braxton Osting, Édouard Oudet:
Harmonic functions on finitely-connected tori. CoRR abs/2309.12459 (2023) - 2022
- [j27]Ryeongkyung Yoon, Harish S. Bhat, Braxton Osting:
A Nonautonomous Equation Discovery Method for Time Signal Classification. SIAM J. Appl. Dyn. Syst. 21(1): 33-59 (2022) - [j26]Nathan Willis, Chee Han Tan, Christel Hohenegger, Braxton Osting:
High Spots for the Ice-Fishing Problem with Surface Tension. SIAM J. Appl. Math. 82(4): 1312-1335 (2022) - [j25]Robert Viator, Braxton Osting:
Steklov Eigenvalues of Nearly Spherical Domains. SIAM J. Control. Optim. 60(3): 1546-1562 (2022) - [i18]Chiu-Yen Kao, Braxton Osting, Jackson C. Turner:
Flat tori with large Laplacian eigenvalues in dimensions up to eight. CoRR abs/2202.08351 (2022) - [i17]Ryeongkyung Yoon, Braxton Osting:
A dynamical systems based framework for dimension reduction. CoRR abs/2204.08155 (2022) - [i16]Braxton Osting:
Extremal graph realizations and graph Laplacian eigenvalues. CoRR abs/2206.10010 (2022) - [i15]Katy Craig, Braxton Osting, Dong Wang, Yiming Xu:
Wasserstein Archetypal Analysis. CoRR abs/2210.14298 (2022) - [i14]Zachary M. Boyd, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting:
Escape times for subgraph detection and graph partitioning. CoRR abs/2212.12839 (2022) - 2021
- [j24]Chiu-Yen Kao, Seyyed Abbas Mohammadi, Braxton Osting:
Linear Convergence of a Rearrangement Method for the One-dimensional Poisson Equation. J. Sci. Comput. 86(1): 6 (2021) - [j23]Braxton Osting, Dong Wang, Yiming Xu, Dominique Zosso:
Consistency of Archetypal Analysis. SIAM J. Math. Data Sci. 3(1): 1-30 (2021) - [j22]Zachary M. Boyd, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting, Jonathan Weare:
A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities. SIAM J. Math. Data Sci. 3(2): 467-493 (2021) - [i13]Ruijian Han, Braxton Osting, Dong Wang, Yiming Xu:
Probabilistic methods for approximate archetypal analysis. CoRR abs/2108.05767 (2021) - [i12]Nathan Willis, Chee Han Tan, Christel Hohenegger, Braxton Osting:
High Spots for the Ice-Fishing Problem with Surface Tension. CoRR abs/2111.10727 (2021) - 2020
- [j21]Braxton Osting, Sourabh Palande, Bei Wang:
Spectral sparsification of simplicial complexes for clustering and label propagation. J. Comput. Geom. 11(1): 176-211 (2020) - [j20]Rachael T. Keller, Jeremy Louis Marzuola, Braxton Osting, Michael I. Weinstein:
ERRATUM: Spectral Band Degeneracies of $\frac{\pi}{2}$-Rotationally Invariant Periodic Schrödinger Operators. Multiscale Model. Simul. 18(3): 1371-1373 (2020) - [j19]Braxton Osting, Dong Wang:
A diffusion generated method for orthogonal matrix-valued fields. Math. Comput. 89(322): 515-550 (2020) - [i11]Amber Yuan, Jeff Calder, Braxton Osting:
A continuum limit for the PageRank algorithm. CoRR abs/2001.08973 (2020) - [i10]Zachary M. Boyd, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting, Jonathan Weare:
A metric on directed graphs and Markov chains based on hitting probabilities. CoRR abs/2006.14482 (2020) - [i9]Ryeongkyung Yoon, Harish S. Bhat, Braxton Osting:
A non-autonomous equation discovery method for time signal classification. CoRR abs/2011.11096 (2020)
2010 – 2019
- 2019
- [j18]Dong Wang, Braxton Osting:
A diffusion generated method for computing Dirichlet partitions. J. Comput. Appl. Math. 351: 302-316 (2019) - [j17]Dong Wang, Braxton Osting, Xiao-Ping Wang:
Interface Dynamics for an Allen-Cahn-Type Equation Governing a Matrix-Valued Field. Multiscale Model. Simul. 17(4): 1252-1273 (2019) - [j16]Ryan Viertel, Braxton Osting:
An Approach to Quad Meshing Based on Harmonic Cross-Valued Maps and the Ginzburg-Landau Theory. SIAM J. Sci. Comput. 41(1): A452-A479 (2019) - [i8]Ryan Viertel, Braxton Osting, Matthew L. Staten:
Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions. CoRR abs/1905.09097 (2019) - 2018
- [j15]Rachael T. Keller, Jeremy Louis Marzuola, Braxton Osting, Michael I. Weinstein:
Spectral Band Degeneracies of $\frac{\pi}{2}$-Rotationally Invariant Periodic Schrödinger Operators. Multiscale Model. Simul. 16(4): 1684-1731 (2018) - [i7]Dong Wang, Braxton Osting:
A diffusion generated method for computing Dirichlet partitions. CoRR abs/1802.02682 (2018) - 2017
- [j14]Dominique Zosso, Braxton Osting, Mandy (Mengqi) Xia, Stanley J. Osher:
An Efficient Primal-Dual Method for the Obstacle Problem. J. Sci. Comput. 73(1): 416-437 (2017) - [j13]Jake J. Abbott, Joseph B. Brink, Braxton Osting:
Computing Minimum-Power Dipole Solutions for Interdipole Forces Using Nonlinear Constrained Optimization With Application to Electromagnetic Formation Flight. IEEE Robotics Autom. Lett. 2(2): 1008-1014 (2017) - [j12]Chee Han Tan, Christel Hohenegger, Braxton Osting:
A Variational Characterization of Fluid Sloshing with Surface Tension. SIAM J. Appl. Math. 77(3): 995-1019 (2017) - [j11]Eldar Akhmetgaliyev, Chiu-Yen Kao, Braxton Osting:
Computational Methods for Extremal Steklov Problems. SIAM J. Control. Optim. 55(2): 1226-1240 (2017) - [j10]Braxton Osting, Todd Harry Reeb:
Consistency of Dirichlet Partitions. SIAM J. Math. Anal. 49(5): 4251-4274 (2017) - [c3]Daniel J. Perry, Braxton Osting, Ross T. Whitaker:
Nyström Sketches. ECML/PKDD (1) 2017: 427-442 - [i6]Ryan Viertel, Braxton Osting:
An Approach to Quad Meshing Based on Harmonic Cross-Valued Maps and the Ginzburg-Landau Theory. CoRR abs/1708.02316 (2017) - [i5]Braxton Osting, Sourabh Palande, Bei Wang:
Towards Spectral Sparsification of Simplicial Complexes Based on Generalized Effective Resistance. CoRR abs/1708.08436 (2017) - [i4]Braxton Osting, Dong Wang:
A generalized MBO diffusion generated motion for orthogonal matrix-valued fields. CoRR abs/1711.01365 (2017) - 2015
- [c2]Dominique Zosso, Braxton Osting, Stanley J. Osher:
A Dirichlet Energy Criterion for Graph-Based Image Segmentation. ICDM Workshops 2015: 821-830 - [i3]Braxton Osting, Jiechao Xiong, Qianqian Xu, Yuan Yao:
Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs. CoRR abs/1503.00164 (2015) - 2014
- [j9]Braxton Osting, Christoph Brune, Stanley J. Osher:
Optimal data collection for informative rankings expose well-connected graphs. J. Mach. Learn. Res. 15(1): 2981-3012 (2014) - [j8]Braxton Osting, Chris D. White, Édouard Oudet:
Minimal Dirichlet Energy Partitions for Graphs. SIAM J. Sci. Comput. 36(4) (2014) - 2013
- [j7]Braxton Osting, Michael I. Weinstein:
Long-Lived Scattering Resonances and Bragg Structures. SIAM J. Appl. Math. 73(2): 827-852 (2013) - [j6]Braxton Osting, Chiu-Yen Kao:
Minimal Convex Combinations of Sequential Laplace-Dirichlet Eigenvalues. SIAM J. Sci. Comput. 35(3) (2013) - [c1]Braxton Osting, Christoph Brune, Stanley J. Osher:
Enhanced statistical rankings via targeted data collection. ICML (1) 2013: 489-497 - [i2]Braxton Osting, Chris D. White, Édouard Oudet:
Minimal Dirichlet energy partitions for graphs. CoRR abs/1308.4915 (2013) - 2012
- [j5]Braxton Osting:
Bragg structure and the first spectral gap. Appl. Math. Lett. 25(11): 1926-1930 (2012) - [i1]Braxton Osting, Christoph Brune, Stanley J. Osher:
Optimal Data Collection for Improved Rankings Expose Well-Connected Graphs. CoRR abs/1207.6430 (2012) - 2011
- [j4]Braxton Osting, Michael I. Weinstein:
Emergence of Periodic Structure from Maximizing the Lifetime of a Bound State Coupled to Radiation. Multiscale Model. Simul. 9(2): 654-685 (2011) - [j3]Harish S. Bhat, Braxton Osting:
2-D Inductor-Capacitor Lattice Synthesis. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(10): 1483-1492 (2011) - 2010
- [j2]Braxton Osting:
Optimization of spectral functions of Dirichlet-Laplacian eigenvalues. J. Comput. Phys. 229(22): 8578-8590 (2010)
2000 – 2009
- 2009
- [j1]Harish S. Bhat, Braxton Osting:
Diffraction on the Two-Dimensional Square Lattice. SIAM J. Appl. Math. 70(5): 1389-1406 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
