A reconstructed discontinuous approximation for distributed elliptic control problems Article Swipe
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2512.08353
In this paper, we present and analyze an internal penalty discontinuous Galerkin method for the distributed elliptic optimal control problems. It is based on a reconstructed discontinuous approximation which admits arbitrarily high-order approximation space with only one unknown per element. Applying this method, we develop a proper discretization scheme that approximates the state and adjoint variables in the approximation space. Our main contributions are twofold: (1) the derivation of both a priori and a posteriori error estimates of the $L^2$-norm and the energy norms, and (2) the implementation of an efficiently solvable discrete system, which is solved via a linearly convergent projected gradient descent method. Numerical experiments are provided to verify the convergence order in a priori estimate and the efficiency of a posteriori error estimate.
Related Topics
- Type
- preprint
- Landing Page
- https://doi.org/10.48550/arxiv.2512.08353
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W7114766291
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7114766291Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2512.08353Digital Object Identifier
- Title
-
A reconstructed discontinuous approximation for distributed elliptic control problemsWork title
- Type
-
preprintOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-12-09Full publication date if available
- Authors
-
Li, Ruo, Liu, Haoyang, Yin, JunList of authors in order
- Landing page
-
https://doi.org/10.48550/arxiv.2512.08353Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.48550/arxiv.2512.08353Direct OA link when available
- Concepts
-
Mathematics, A priori and a posteriori, Discretization, Convergence (economics), Applied mathematics, Approximation error, Discontinuous Galerkin method, Gradient descent, Optimal control, Galerkin method, Approximation theory, Space (punctuation), Mathematical analysis, Scheme (mathematics), Mathematical optimization, Adjoint equation, Error detection and correction, Approximation algorithm, Descent (aeronautics), Energy (signal processing), Elliptic curve, Iterative method, Gradient method, Discretization error, A priori estimate, Rate of convergence, State space, State (computer science)Top concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7114766291 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2512.08353 |
| ids.doi | https://doi.org/10.48550/arxiv.2512.08353 |
| ids.openalex | https://openalex.org/W7114766291 |
| fwci | |
| type | preprint |
| title | A reconstructed discontinuous approximation for distributed elliptic control problems |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C33923547 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7677713632583618 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[0].display_name | Mathematics |
| concepts[1].id | https://openalex.org/C75553542 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7478578686714172 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q178161 |
| concepts[1].display_name | A priori and a posteriori |
| concepts[2].id | https://openalex.org/C73000952 |
| concepts[2].level | 2 |
| concepts[2].score | 0.7139605283737183 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q17007827 |
| concepts[2].display_name | Discretization |
| concepts[3].id | https://openalex.org/C2777303404 |
| concepts[3].level | 2 |
| concepts[3].score | 0.590983510017395 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q759757 |
| concepts[3].display_name | Convergence (economics) |
| concepts[4].id | https://openalex.org/C28826006 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5470454096794128 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q33521 |
| concepts[4].display_name | Applied mathematics |
| concepts[5].id | https://openalex.org/C122383733 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5409453511238098 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q865920 |
| concepts[5].display_name | Approximation error |
| concepts[6].id | https://openalex.org/C92244383 |
| concepts[6].level | 3 |
| concepts[6].score | 0.5112162232398987 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q428273 |
| concepts[6].display_name | Discontinuous Galerkin method |
| concepts[7].id | https://openalex.org/C153258448 |
| concepts[7].level | 3 |
| concepts[7].score | 0.42082127928733826 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1199743 |
| concepts[7].display_name | Gradient descent |
| concepts[8].id | https://openalex.org/C91575142 |
| concepts[8].level | 2 |
| concepts[8].score | 0.39858704805374146 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1971426 |
| concepts[8].display_name | Optimal control |
| concepts[9].id | https://openalex.org/C186899397 |
| concepts[9].level | 3 |
| concepts[9].score | 0.398309588432312 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1491980 |
| concepts[9].display_name | Galerkin method |
| concepts[10].id | https://openalex.org/C145242015 |
| concepts[10].level | 2 |
| concepts[10].score | 0.36034467816352844 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q774123 |
| concepts[10].display_name | Approximation theory |
| concepts[11].id | https://openalex.org/C2778572836 |
| concepts[11].level | 2 |
| concepts[11].score | 0.3565894365310669 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q380933 |
| concepts[11].display_name | Space (punctuation) |
| concepts[12].id | https://openalex.org/C134306372 |
| concepts[12].level | 1 |
| concepts[12].score | 0.34200015664100647 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[12].display_name | Mathematical analysis |
| concepts[13].id | https://openalex.org/C77618280 |
| concepts[13].level | 2 |
| concepts[13].score | 0.32116496562957764 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1155772 |
| concepts[13].display_name | Scheme (mathematics) |
| concepts[14].id | https://openalex.org/C126255220 |
| concepts[14].level | 1 |
| concepts[14].score | 0.3182993531227112 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[14].display_name | Mathematical optimization |
| concepts[15].id | https://openalex.org/C165551260 |
| concepts[15].level | 3 |
| concepts[15].score | 0.3095752000808716 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q4428962 |
| concepts[15].display_name | Adjoint equation |
| concepts[16].id | https://openalex.org/C103088060 |
| concepts[16].level | 2 |
| concepts[16].score | 0.3085431158542633 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1062839 |
| concepts[16].display_name | Error detection and correction |
| concepts[17].id | https://openalex.org/C148764684 |
| concepts[17].level | 2 |
| concepts[17].score | 0.3063142001628876 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q621751 |
| concepts[17].display_name | Approximation algorithm |
| concepts[18].id | https://openalex.org/C2776637919 |
| concepts[18].level | 2 |
| concepts[18].score | 0.30080634355545044 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q624380 |
| concepts[18].display_name | Descent (aeronautics) |
| concepts[19].id | https://openalex.org/C186370098 |
| concepts[19].level | 2 |
| concepts[19].score | 0.2891506254673004 |
| concepts[19].wikidata | https://www.wikidata.org/wiki/Q442787 |
| concepts[19].display_name | Energy (signal processing) |
| concepts[20].id | https://openalex.org/C179603306 |
| concepts[20].level | 2 |
| concepts[20].score | 0.28870150446891785 |
| concepts[20].wikidata | https://www.wikidata.org/wiki/Q268493 |
| concepts[20].display_name | Elliptic curve |
| concepts[21].id | https://openalex.org/C159694833 |
| concepts[21].level | 2 |
| concepts[21].score | 0.2784006893634796 |
| concepts[21].wikidata | https://www.wikidata.org/wiki/Q2321565 |
| concepts[21].display_name | Iterative method |
| concepts[22].id | https://openalex.org/C115680565 |
| concepts[22].level | 2 |
| concepts[22].score | 0.2758849561214447 |
| concepts[22].wikidata | https://www.wikidata.org/wiki/Q5977448 |
| concepts[22].display_name | Gradient method |
| concepts[23].id | https://openalex.org/C126148662 |
| concepts[23].level | 3 |
| concepts[23].score | 0.27411627769470215 |
| concepts[23].wikidata | https://www.wikidata.org/wiki/Q3890355 |
| concepts[23].display_name | Discretization error |
| concepts[24].id | https://openalex.org/C2775918384 |
| concepts[24].level | 2 |
| concepts[24].score | 0.2630361318588257 |
| concepts[24].wikidata | https://www.wikidata.org/wiki/Q4660961 |
| concepts[24].display_name | A priori estimate |
| concepts[25].id | https://openalex.org/C57869625 |
| concepts[25].level | 3 |
| concepts[25].score | 0.26239341497421265 |
| concepts[25].wikidata | https://www.wikidata.org/wiki/Q1783502 |
| concepts[25].display_name | Rate of convergence |
| concepts[26].id | https://openalex.org/C72434380 |
| concepts[26].level | 2 |
| concepts[26].score | 0.2544502913951874 |
| concepts[26].wikidata | https://www.wikidata.org/wiki/Q230930 |
| concepts[26].display_name | State space |
| concepts[27].id | https://openalex.org/C48103436 |
| concepts[27].level | 2 |
| concepts[27].score | 0.252481609582901 |
| concepts[27].wikidata | https://www.wikidata.org/wiki/Q599031 |
| concepts[27].display_name | State (computer science) |
| keywords[0].id | https://openalex.org/keywords/a-priori-and-a-posteriori |
| keywords[0].score | 0.7478578686714172 |
| keywords[0].display_name | A priori and a posteriori |
| keywords[1].id | https://openalex.org/keywords/discretization |
| keywords[1].score | 0.7139605283737183 |
| keywords[1].display_name | Discretization |
| keywords[2].id | https://openalex.org/keywords/convergence |
| keywords[2].score | 0.590983510017395 |
| keywords[2].display_name | Convergence (economics) |
| keywords[3].id | https://openalex.org/keywords/approximation-error |
| keywords[3].score | 0.5409453511238098 |
| keywords[3].display_name | Approximation error |
| keywords[4].id | https://openalex.org/keywords/discontinuous-galerkin-method |
| keywords[4].score | 0.5112162232398987 |
| keywords[4].display_name | Discontinuous Galerkin method |
| keywords[5].id | https://openalex.org/keywords/gradient-descent |
| keywords[5].score | 0.42082127928733826 |
| keywords[5].display_name | Gradient descent |
| keywords[6].id | https://openalex.org/keywords/optimal-control |
| keywords[6].score | 0.39858704805374146 |
| keywords[6].display_name | Optimal control |
| keywords[7].id | https://openalex.org/keywords/galerkin-method |
| keywords[7].score | 0.398309588432312 |
| keywords[7].display_name | Galerkin method |
| keywords[8].id | https://openalex.org/keywords/approximation-theory |
| keywords[8].score | 0.36034467816352844 |
| keywords[8].display_name | Approximation theory |
| language | |
| locations[0].id | doi:10.48550/arxiv.2512.08353 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | public-domain |
| locations[0].pdf_url | |
| locations[0].version | |
| locations[0].raw_type | article |
| locations[0].license_id | https://openalex.org/licenses/public-domain |
| locations[0].is_accepted | False |
| locations[0].is_published | |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.48550/arxiv.2512.08353 |
| indexed_in | datacite |
| authorships[0].author.id | |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Li, Ruo |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Li, Ruo |
| authorships[0].is_corresponding | True |
| authorships[1].author.id | |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Liu, Haoyang |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Liu, Haoyang |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Yin, Jun |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Yin, Jun |
| authorships[2].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.48550/arxiv.2512.08353 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-12-11T00:00:00 |
| display_name | A reconstructed discontinuous approximation for distributed elliptic control problems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-12-11T23:13:37.075516 |
| primary_topic | |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.48550/arxiv.2512.08353 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | public-domain |
| best_oa_location.pdf_url | |
| best_oa_location.version | |
| best_oa_location.raw_type | article |
| best_oa_location.license_id | https://openalex.org/licenses/public-domain |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.48550/arxiv.2512.08353 |
| primary_location.id | doi:10.48550/arxiv.2512.08353 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | public-domain |
| primary_location.pdf_url | |
| primary_location.version | |
| primary_location.raw_type | article |
| primary_location.license_id | https://openalex.org/licenses/public-domain |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.48550/arxiv.2512.08353 |
| publication_date | 2025-12-09 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 24, 45, 70, 73, 98, 115, 122 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.It | 20 |
| abstract_inverted_index.an | 7, 89 |
| abstract_inverted_index.in | 56, 114 |
| abstract_inverted_index.is | 21, 95 |
| abstract_inverted_index.of | 68, 77, 88, 121 |
| abstract_inverted_index.on | 23 |
| abstract_inverted_index.to | 109 |
| abstract_inverted_index.we | 3, 43 |
| abstract_inverted_index.(1) | 65 |
| abstract_inverted_index.(2) | 85 |
| abstract_inverted_index.Our | 60 |
| abstract_inverted_index.and | 5, 53, 72, 80, 84, 118 |
| abstract_inverted_index.are | 63, 107 |
| abstract_inverted_index.for | 13 |
| abstract_inverted_index.one | 36 |
| abstract_inverted_index.per | 38 |
| abstract_inverted_index.the | 14, 51, 57, 66, 78, 81, 86, 111, 119 |
| abstract_inverted_index.via | 97 |
| abstract_inverted_index.both | 69 |
| abstract_inverted_index.main | 61 |
| abstract_inverted_index.only | 35 |
| abstract_inverted_index.that | 49 |
| abstract_inverted_index.this | 1, 41 |
| abstract_inverted_index.with | 34 |
| abstract_inverted_index.based | 22 |
| abstract_inverted_index.error | 75, 124 |
| abstract_inverted_index.order | 113 |
| abstract_inverted_index.space | 33 |
| abstract_inverted_index.state | 52 |
| abstract_inverted_index.which | 28, 94 |
| abstract_inverted_index.admits | 29 |
| abstract_inverted_index.energy | 82 |
| abstract_inverted_index.method | 12 |
| abstract_inverted_index.norms, | 83 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.priori | 71, 116 |
| abstract_inverted_index.proper | 46 |
| abstract_inverted_index.scheme | 48 |
| abstract_inverted_index.solved | 96 |
| abstract_inverted_index.space. | 59 |
| abstract_inverted_index.verify | 110 |
| abstract_inverted_index.adjoint | 54 |
| abstract_inverted_index.analyze | 6 |
| abstract_inverted_index.control | 18 |
| abstract_inverted_index.descent | 103 |
| abstract_inverted_index.develop | 44 |
| abstract_inverted_index.method, | 42 |
| abstract_inverted_index.method. | 104 |
| abstract_inverted_index.optimal | 17 |
| abstract_inverted_index.penalty | 9 |
| abstract_inverted_index.present | 4 |
| abstract_inverted_index.system, | 93 |
| abstract_inverted_index.unknown | 37 |
| abstract_inverted_index.Applying | 40 |
| abstract_inverted_index.Galerkin | 11 |
| abstract_inverted_index.discrete | 92 |
| abstract_inverted_index.element. | 39 |
| abstract_inverted_index.elliptic | 16 |
| abstract_inverted_index.estimate | 117 |
| abstract_inverted_index.gradient | 102 |
| abstract_inverted_index.internal | 8 |
| abstract_inverted_index.linearly | 99 |
| abstract_inverted_index.provided | 108 |
| abstract_inverted_index.solvable | 91 |
| abstract_inverted_index.twofold: | 64 |
| abstract_inverted_index.Numerical | 105 |
| abstract_inverted_index.estimate. | 125 |
| abstract_inverted_index.estimates | 76 |
| abstract_inverted_index.problems. | 19 |
| abstract_inverted_index.projected | 101 |
| abstract_inverted_index.variables | 55 |
| abstract_inverted_index.$L^2$-norm | 79 |
| abstract_inverted_index.convergent | 100 |
| abstract_inverted_index.derivation | 67 |
| abstract_inverted_index.efficiency | 120 |
| abstract_inverted_index.high-order | 31 |
| abstract_inverted_index.posteriori | 74, 123 |
| abstract_inverted_index.arbitrarily | 30 |
| abstract_inverted_index.convergence | 112 |
| abstract_inverted_index.distributed | 15 |
| abstract_inverted_index.efficiently | 90 |
| abstract_inverted_index.experiments | 106 |
| abstract_inverted_index.approximates | 50 |
| abstract_inverted_index.approximation | 27, 32, 58 |
| abstract_inverted_index.contributions | 62 |
| abstract_inverted_index.discontinuous | 10, 26 |
| abstract_inverted_index.reconstructed | 25 |
| abstract_inverted_index.discretization | 47 |
| abstract_inverted_index.implementation | 87 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile |