Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A categorical approach to the maximum theorem
Download
index.pdf
Date
2018-08-01
Author
Koudenburg, Seerp Roald
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
373
views
88
downloads
Cite This
Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double categories.
Subject Keywords
Kan extensions
URI
https://hdl.handle.net/11511/64322
Journal
JOURNAL OF PURE AND APPLIED ALGEBRA
DOI
https://doi.org/10.1016/j.jpaa.2017.09.002
Collections
Natural Sciences and Mathematics, Article
Suggestions
OpenMETU
Core
An anticipatory extension of Malthusian model
Akhmet, Marat; Öktem, Hüseyin Avni (2005-08-13)
In this paper, on the base of a new variable - deviation of population from an average value, we propose a new extension of the Malthusian model (see equations (10), (15) and (20)) using differential equations with piecewise constant argument which can be retarded as well as advanced. We study existence of periodic solutions and stability of the equations by method of reduction to discrete equations [4]. Equations (15) and (20) with advanced argument are systems with strong anticipation [6, 7]. Moreover, we...
A new anisotropic perfectly matched layer medium for mesh truncation in finite difference time domain analysis
Tong, MS; Chen, YC; Kuzuoğlu, Mustafa; Mittra, R (1999-09-01)
In this paper an unsplit anisotropic perfectly matched layer (PML) medium, previously utilized in the context of finite element analysis, is implemented in the finite difference time domain (FDTD) algorithm. The FDTD anisotropic PML is easy to implement in the existing FDTD codes, and is well suited for truncating inhomogeneous and layered media without special treatment required in the conventional PML approach. A further advantage of the present approach is improved performance at lower frequencies. The a...
A singularly perturbed differential equation with piecewise constant argument of generalized type
Akhmet, Marat; Mirzakulova, Aziza (The Scientific and Technological Research Council of Turkey, 2018-01-01)
The paper considers the extension of Tikhonov Theorem for singularly perturbed differential equation with piecewise constant argument of generalized type. An approximate solution of the problem has been obtained. A new phenomenon of humping has been observed in the boundary layer area. An illustrative example with simulations is provided.
A ROBUST ITERATIVE SCHEME FOR SYMMETRIC INDEFINITE SYSTEMS
Manguoğlu, Murat (Society for Industrial & Applied Mathematics (SIAM), 2019-01-01)
We propose a two-level nested preconditioned iterative scheme for solving sparse linear systems of equations in which the coefficient matrix is symmetric and indefinite with a relatively small number of negative eigenvalues. The proposed scheme consists of an outer minimum residual (MINRES) iteration, preconditioned by an inner conjugate gradient (CG) iteration in which CG can be further preconditioned. The robustness of the proposed scheme is illustrated by solving indefinite linear systems that arise in t...
A SUPER-SET OF PATTERSON-WIEDEMANN FUNCTIONS: UPPER BOUNDS AND POSSIBLE NONLINEARITIES
Kavut, Selcuk; MAİTRA, Subhamoy; Özbudak, Ferruh (2018-01-01)
Construction of Boolean functions on an odd number of variables with nonlinearity exceeding the bent concatenation bound is one of the most difficult combinatorial problems within the domain of Boolean functions. This problem also has deep implications in coding theory and cryptology. Patterson and Wiedemann demonstrated instances of such functions back in 1983. For more than three decades efforts have been channeled into obtaining such instances. For the first time, in this paper we explore nontrivial uppe...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. R. Koudenburg, “A categorical approach to the maximum theorem,”
JOURNAL OF PURE AND APPLIED ALGEBRA
, pp. 2099–2142, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64322.